Sciweavers

16 search results - page 1 / 4
» tlca 2009
Sort
View
121
Voted
TLCA
2009
Springer
15 years 8 months ago
Refinement Types as Proof Irrelevance
William Lovas, Frank Pfenning
132
Voted
TLCA
2009
Springer
15 years 10 months ago
Mathematical Synthesis of Equational Deduction Systems
Marcelo P. Fiore, Chung-Kil Hur
153
Voted
TLCA
2009
Springer
15 years 10 months ago
Syntax for Free: Representing Syntax with Binding Using Parametricity
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
Robert Atkey