Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Normalization by Evaluation for MartinLof Type Theory

Summary: Normalization by Evaluation
for Martin­L˜of Type Theory
with One Universe
From PER Model to Subset Model
Andreas Abel 1
Institut f˜ur Informatik, Ludwig­Maximilians­Universit˜at
Oettingenstr. 67, D­80538 M˜unchen
We show how to replace the PER model of the original MFPS 2007 publication by a simpler subset model
without losing any results. This observation follows from the general insight that PER semantics is strongly
preferable when one models judgemental (aka typed) equality, yet for untyped equality is has no advantage
over subset semantics.
The paper under discussion[1] constructs a model of type theory over an untyped
#­model D, by constructing a partial equivalence relation (PER) Type # D×D which
identifies the type values in D, plus for each a # Type an associated PER [a] # D×D
which identifies the values of type a in D. Equal types a = a # # Type have equal
extensions [a] = [a # ]. The purpose of a PER semantics is to model extensional
equality on values, and it defines f = f # # [Pi a g] i# f · d = f # · d # # [g(d)]
for all d = d # # [a]. However, we have already treated #­equality in the term
model D; in Lemma 3.4 we show that t -# ## t # implies [[t]] # # [[t # ]] # (in particular


Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München


Collections: Computer Technologies and Information Sciences