Sciweavers

16 search results - page 1 / 4
» tlca 2009
Sort
View
TLCA
2009
Springer
13 years 10 months ago
Refinement Types as Proof Irrelevance
William Lovas, Frank Pfenning
TLCA
2009
Springer
14 years 25 days 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