This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
16th Annual IEEE Symposium on Logic in Computer Science (LICS'01)
Normalization by Evaluation for Typed Lambda Calculus with Coproducts
Boston, Massachusetts
June 16-June 19
ISBN: 0-7695-1281-X
Abstract: We solve the decision problem for simply typed lambda calculus with strong binary sums, equivalently the word problem for free cartesian closed categories with binary coproducts. Our method is based on the semantical technique known as "normalization by evaluation" and involves inverting the interpretation of the syntax into a suitable sheaf model and from this extracting appropriate unique normal forms. There is no rewriting theory involved, and the proof is completely constructive, allowing program extraction from the proof.
Citation:
T. Altenkirch, P. Dybjer, M. Hofmannz, P. Scott, "Normalization by Evaluation for Typed Lambda Calculus with Coproducts," lics, pp.0303, 16th Annual IEEE Symposium on Logic in Computer Science (LICS'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.