Normalization by Evaluation for λ→2

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2998, Issue , 2004, Pages 260-275

  Altenkirch, Thorsten ^a,b   Uustalu, Tarmo ^a,b  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b TALLINN UNIVERSITY OF TECHNOLOGY   (Estonia)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; DECISION TREES; DIFFERENTIATION (CALCULUS); FUNCTIONAL PROGRAMMING; LOGIC PROGRAMMING; SEMANTICS;

HASKELL; LOGICAL RELATIONS; NORMALIZATION BY EVALUATION; SIMPLY TYPED LAMBDA CALCULUS; THEORETIC SEMANTICS; TYPE VARIABLES;

CALCULATIONS;

EID: 35048841111     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24754-8_19     Document Type: Article

References (13)

1. T. Altenkirch, P. Dybjer, M. Hofmann, and P. Scott. Normalization by evaluation for typed lambda calculus with coproducts. In Proc. of 16th Annual IEEE Symposium on Logic in Computer Science, pages 303-310. IEEE CS Press, 2001.
2. T. Altenkirch, M. Hofmann, and T. Streicher. Categorical reconstruction of a reduction free normalization proof. In D. Pitt, D. E. Rydeheard, and P. Johnstone, editors, Category Theory and Computer Science, number 953 in LNCS, pages 182199, Springer-Verlag, 1995.
3. T. Altenkirch, M. Hofmann, and T. Streicher. Reduction-free normalisation for a polymorphic system. In Proc. of 11th Annual IEEE Symposium on Logic in Computer Science, pages 98-106. IEEE CS Press, 1996.
4. T. Altenkirch, M. Hofmann, and T. Streicher. Reduction-free normalisation for system F. Unpublished, available on WWW at http://www.cs.nott.ac.uk/ ̃txa/publ/f97.pdf, 1997.
5. V. Balat. Une étude des sommes fortes : isomorphismes et formes normales. PhD thesis, Université Denis Diderot, 2002.
6. U. Berger and H. Schwichtenberg. An inverse of the evaluation functional for typed A-calculus. In Proc. of 6th Annual IEEE Symposium on Logic in Computer Science, pages 202-211. IEEE CS Press, 1991.
7. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans, on Computers, 35(8):677-691, 1986.
8. D. J. Dougherty and R. Subrahmanyam. Equality between functionals in the presence of coproducts. Information and Computation, 157(l-2):52-83, 2000.
9. P. Dybjer and A. Filinski. Normalization and partial evaluation. In G. Barthe et al., editors, Applied Semantics, number 2395 in LNCS, pages 137-192. SpringerVerlag, 2002.
10. N. Ghani. Adjoint Rewriting. PhD thesis, LFCS, Univ. of Edinburgh, 1995.
11. N. Ghani. βη-equality for coproducts. In M. Dezani-Ciancaglini and G. D. Plotkin, editors, Typed Lambda Calculus and Applications, number 902 in LNCS, pages 171185. Springer-Verlag, 1995.
12. C. McBride and J. McKinna. The view from the left. To appear in the Journal of Functional Programming, Special Issue: Dependent Type Theory Meets Programming Practice, 2004.
13. G. D. Plotkin. Lambda-definability and logical relations. Memorandum SAI-RM-4, Lab. for Artif. Intell., Univ. of Edinburgh, Oct. 1973.