15 search results - page 1 / 3 » Linear realizability and full completeness for typed lambda-... |
APAL
2005
13 years 5 months ago
2005
ICFP
2010
ACM
13 years 5 months ago
2010
ACM
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
CORR
2011
Springer
13 years 7 days ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
LICS
2009
IEEE
13 years 12 months ago
2009
IEEE
Abstract. Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies ...
APLAS
2001
ACM
13 years 9 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...