CIE
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this inte...
FPCA
1991
14 years 4 months ago
1991
We develop a calculus for lazy functional programming based on recursion operators associated with data type de nitions. For these operators we derive various algebraic laws that ...
SAS
1994
Springer
14 years 4 months ago
1994
Springer
Strictness analysis has been a living field of investigation since Mycroft's original work in 1980, and is getting increasingly significant with the still wider use of lazy fu...
GI
2009
Springer
14 years 5 months ago
2009
Springer
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
ICFP
2004
ACM
15 years 12 days ago
2004
ACM
Recent functional logic languages such as Curry and Toy combine lazy functional programming with logic programming features including logic variables, non-determinism, unification...