29 search results - page 3 / 6 » Kripke-Style models for typed lambda calculus |
TOCL
2012
11 years 9 months ago
2012
racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...
LFCS
1994
Springer
13 years 11 months ago
1994
Springer
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
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...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
FOSSACS
2005
Springer
14 years 19 days ago
2005
Springer
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...