Sciweavers

894 search results - page 12 / 179
» Typed Contracts for Functional Programming
Sort
View
ISAAC
2010
Springer
240views Algorithms» more  ISAAC 2010»
13 years 6 months ago
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity
We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such pr...
Hugo Férée, Emmanuel Hainry, Mathieu...
PLDI
2010
ACM
14 years 6 months ago
Ur: Statically-Typed Metaprogramming with Type-Level Record Computation
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
Adam Chlipala
PLDI
2005
ACM
14 years 2 months ago
Checking type safety of foreign function calls
We present a multi-lingual type inference system for checking type safety across a foreign function interface. The goal of our system is to prevent foreign function calls from int...
Michael Furr, Jeffrey S. Foster
HASKELL
2005
ACM
14 years 2 months ago
TypeCase: a design pattern for type-indexed functions
A type-indexed function is a function that is defined for each member of some family of types. Haskell’s type class mechanism provides collections of open type-indexed function...
Bruno C. D. S. Oliveira, Jeremy Gibbons
ICML
1995
IEEE
14 years 9 months ago
Stable Function Approximation in Dynamic Programming
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
Geoffrey J. Gordon