Sciweavers

CIE
2010
Springer
13 years 9 months ago
Proofs, Programs, Processes
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...
Ulrich Berger, Monika Seisenberger
FPCA
1991
14 years 2 months ago
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire
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 ...
Erik Meijer, Maarten M. Fokkinga, Ross Paterson
SAS
1994
Springer
105views Formal Methods» more  SAS 1994»
14 years 3 months ago
Efficient Strictness Analysis of Haskell
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...
Kristian Damm Jensen, Peter Hjæresen, Mads R...
GI
2009
Springer
14 years 3 months ago
Taming Selective Strictness
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...
Daniel Seidel, Janis Voigtländer
ICFP
2004
ACM
14 years 11 months ago
Implementing functional logic languages using multiple threads and stores
Recent functional logic languages such as Curry and Toy combine lazy functional programming with logic programming features including logic variables, non-determinism, unification...
Andrew P. Tolmach, Sergio Antoy, Marius Nita