Authors: Altenkirch, Thorsten and Kaposi, Ambrus

We develop normalisation by evaluation (NBE) for dependent types based on presheaf categories. Our construction is formulated in the metalanguage of type theory using quotient inductive types. We use a typed presentation hence there are no preterms or realizers in our construction, and every construction respects the conversion relation. NBE for simple types uses a logical relation between the syntax and the presheaf interpretation. In our construction, we merge the presheaf interpretation and the logical relation into a proof-relevant logical predicate. We prove normalisation, completeness, stability and decidability of definitional equality. Most of the constructions were formalized in Agda.

Volume: Volume 13, Issue 4

Published on: October 23, 2017

Submitted on: September 4, 2017

Keywords: Computer Science - Logic in Computer Science,F.4.1

Download this file

Consult the article webpage