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.

Abstract. We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed de Bruijn terms.

To demonstrate the proof we have constructed a model of parametric polymorphism inside the Coq proof assistant. The proof of the theorem requires parametricity ...

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. Research output: Chapter in Book/Report/Conference proceeding ...

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 ...

Nov 4, 2021 · In this post, I will give an overview of all the different techniques for implementing syntax with binders in Agda that I could find.