135 search results - page 14 / 27 » A typed lambda calculus with intersection types |
CORR
2011
Springer
13 years 2 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...
ENTCS
2008
13 years 7 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...
ENTCS
2002
13 years 7 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...
CSL
2008
Springer
13 years 9 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...
LICS
2008
IEEE
14 years 1 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...