31 search results - page 1 / 7 » Relational Parametricity for a Polymorphic Linear Lambda Cal... |
89
Voted
APLAS
2010
ACM
15 years 1 months ago
2010
ACM
111
Voted
ENTCS
2006
15 years 1 months ago
2006
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
103
Voted
CORR
2011
Springer
14 years 8 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...
106
Voted
ICFP
2004
ACM
16 years 1 months ago
2004
ACM
Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and fu...
109
Voted
LICS
2008
IEEE
15 years 7 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...