Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Normalization by hereditary substitutions Chantal Keller
 

Summary: Normalization by hereditary substitutions
Chantal Keller

INRIA Saclay­Île-de-France
France
keller@lix.polytechnique.fr
Thorsten Altenkirch
The University of Nottingham
United Kingdom
txa@cs.nott.ac.uk
ABSTRACT
We analyze a normalization function for the simply typed
-calculus based on hereditary substitutions, a technique de-
veloped by Pfenning et al. The normalizer is implemented
in Agda, a total language where all programs terminate. It
requires no termination proof since it is structurally recur-
sive which is recognized by Agda's termination checker. Us-
ing Agda as an interactive theorem prover we establish that
our normalization function precisely identifies -equivalent
terms and hence can be used to decide -equality. An in-

  

Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham

 

Collections: Computer Technologies and Information Sciences