Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Syntactic Normalization Proofs Andreas Abel
 

Summary: Syntactic Normalization Proofs
Andreas Abel
Department of Computer Science
Ludwig-Maximilians-University Munich
ProgLog Seminar, Chalmers, G®oteborg
March 14, 2007
Andreas Abel (LMU Munich) Syntactic Normalization Proofs ProgLog'07 1 / 17
Introduction
Research: normalization proofs in Twelf.
Twelf: higher-order abstract syntax.
Comfortable variable handling, but no recursive functions.
Only 2 statements (xyA).
Termination orders: lexicographic extension of structural order,
i.e., < .
Andreas Abel (LMU Munich) Syntactic Normalization Proofs ProgLog'07 2 / 17
Simply-Typed Lambda-Calculus
A Normalizer for Simply-Typed Lambda-Calculus
A structurally recursive normalizer:
nf(x) = x
nf(x :A.t) = x :A. nf(t)

  

Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universit√§t M√ľnchen

 

Collections: Computer Technologies and Information Sciences