3385 search results - page 485 / 677 » Language, Logic, and the Brain |
164
click to vote
CORR
2011
Springer
15 years 1 months 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...
150
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates, as well as Boolean operations on regions, interpreted over low-...
178
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present...
157
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
162
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...