16 search results - page 1 / 4 » A Calculus with Lazy Module Operators |
IFIP
2004
Springer
13 years 11 months ago
2004
Springer
EUROCAST
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. This paper introduces a higher-order lazy narrowing calculus (HOLN for short) that solves higher-order equations over the domain of simply typed λ-terms. HOLN is an exte...
POPL
2009
ACM
14 years 6 months ago
2009
ACM
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a seri...
FPCA
1991
13 years 9 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 ...
ESOP
2000
Springer
13 years 9 months ago
2000
Springer
We present a module calculus for studying a simple model of link-time compilation. The calculus is stratified into a term calculus, a core module calculus, and a linking calculus. ...