29 search results - page 1 / 6 » Kripke-Style models for typed lambda calculus |
62
Voted
LICS
1987
IEEE
15 years 1 months ago
1987
IEEE
122
Voted
APLAS
2001
ACM
15 years 1 months ago
2001
ACM
Abstract. We propose a semantic and syntactic framework for modelling linearly used effects, by giving the monadic transforms of the computational lambda calculus (considered as th...
98
Voted
FCT
2005
Springer
15 years 3 months ago
2005
Springer
We consider terms of simply typed lambda calculus in which copy of a subterm may not be inserted to the argument of itself during the reduction. The terms form wide class which inc...
EMNLP
2011
13 years 10 months ago
2011
77
Voted
TCS
1998
14 years 10 months ago
1998
We show that unary PCF, a very small fragment of Plotkin’s PCF [?], cidable observational pre-order, and that its fully abstract model is effectively presentable. This is in ma...