Sciweavers

220 search results - page 1 / 44
» Calling variadic functions from a strongly-typed language
Sort
View
ML
2008
ACM
115views Machine Learning» more  ML 2008»
13 years 4 months ago
Calling variadic functions from a strongly-typed language
The importance of providing a mechanism to call C functions from high-level languages has been understood for many years and, these days, almost all statically-typed high-level-la...
Matthias Blume, Mike Rainey, John H. Reppy
HASKELL
2006
ACM
13 years 10 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser
ILP
1998
Springer
13 years 8 months ago
Strongly Typed Inductive Concept Learning
In this paper we argue that the use of a language with a type system, together with higher-order facilities and functions, provides a suitable basis for knowledge representation in...
Peter A. Flach, Christophe G. Giraud-Carrier, John...
ICFP
1999
ACM
13 years 8 months ago
Calling Hell From Heaven and Heaven From Hell
The increasing popularity of component-based programming tools offer a big opportunity to designers of advanced programming languages, such as Haskell. If we can package our progr...
Sigbjorn Finne, Daan Leijen, Erik Meijer, Simon L....
ESOP
2009
Springer
13 years 11 months ago
Practical Variable-Arity Polymorphism
Just as some functions have uniform behavior over distinct types, other functions have uniform behavior over distinct arities. These variable-arity functions are widely used in scr...
T. Stephen Strickland, Sam Tobin-Hochstadt, Matthi...