424 search results - page 34 / 85 » A Lambda Calculus with Forms |
LICS
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper describes two new bisimulation equivalences for the pure untyped call-by-value λ-calculus, called enf bisimilarity and enf bisimilarity up to η. They are based on eag...
CSL
2009
Springer
14 years 2 months ago
2009
Springer
We define an “enriched effect calculus” by extending a type theory for computational effects with primitives from linear logic. The new calculus, which generalises intuitionis...
CSL
1999
Springer
13 years 12 months ago
1999
Springer
This paper gives the first proof that the subtyping relation of a higherorder lambda calculus, Fω ≤, is anti-symmetric, establishing in the process that the subtyping relation...
ICFP
1997
ACM
13 years 11 months ago
1997
ACM
d Abstract) Allyn Dimock Harvard University Robert Muller Boston College Franklyn Turbak Wellesley College J. B. Wells∗ Glasgow University Topic Areas: compilation, lambda calcul...
POPL
1996
ACM
13 years 11 months ago
1996
ACM
Region Inference is a technique for implementing programming languages that are based on typed call-by-value lambda calculus, such as Standard ML. The mathematical runtime model o...