4107 search results - page 4 / 822 » The Generalized Lambda Test |
TYPES
2007
Springer
15 years 5 months ago
2007
Springer
We present a procedure for computing normal forms of terms in Abadi and Cardelli’s functional object calculus. Even when equipped with simple types, terms of this calculus are no...
114
click to vote
LOGCOM
2010
14 years 10 months ago
2010
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untype...
178
click to vote
POPL
2004
ACM
15 years 12 months ago
2004
ACM
We present a notion of -long ? -normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in norm...
WOLLIC
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
APLAS
2009
ACM
15 years 4 months ago
2009
ACM
We study the resource calculus – the non-lazy version of Boudol’s λ-calculus with resources. In such a calculus arguments may be finitely available and mixed, giving rise to ...