135 search results - page 14 / 27 » A typed lambda calculus with intersection types |
118
click to vote
CORR
2011
Springer
14 years 10 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...
110
click to vote
ENTCS
2008
15 years 2 months ago
2008
We argue that symmetric (semi)monoidal comonads provide a means to structure context-dependent notions of computation such as notions of dataflow computation (computation on strea...
141
click to vote
ENTCS
2002
15 years 2 months ago
2002
By using intersection types and filter models we formulate a theory of types for a -calculus with record subtyping via a finitary programming logic. Types are interpreted as space...
104
click to vote
CSL
2008
Springer
15 years 4 months ago
2008
Springer
The study of type isomorphisms for different -calculi started over twenty years ago, and a very wide body of knowledge has been established, both in terms of results and in terms o...
124
click to vote
LICS
2008
IEEE
15 years 9 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...