To demonstrate the proof we have constructed a model of parametric polymorphism inside the Coq proof assistant. The proof of the theorem requires parametricity ...
Syntax For Free: Representing Syntax with. Binding using Parametricity ... We now consider explicitly representing free variables in terms using any data.
Dive into the research topics of 'Syntax for Free: Representing Syntax with Binding Using Parametricity'. Together they form a unique fingerprint.
Syntax for free: representing syntax with binding using parametricity
strathprints.strath.ac.uk › ...
To demonstrate the proof we have constructed a model of parametric polymorphism inside the Coq proof assistant. The proof of the theorem requires parametricity ...
Abstract. We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed de Bruijn terms.
It is shown that, in a parametric model of polymorphism, the type of closed higher-order abstract syntax terms is isomorphic to closed de Bruijn terms, ...
Syntax for free: representing syntax with binding using parametricity. Robert Atkey · Computer And Information Sciences · Mathematically Structured Programming.
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev. Hosted as a part of SLEBOK on ...
buildLam is not an isomorphism! LamBB is the real thing. Syntax for Free - Representing. Syntax with Binding Using Parametricity. (Atkey 2009). Page 17. class ...