Extensional rewriting with sums

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

Volumn 4583 LNCS, Issue , 2007, Pages 255-271

  Lindley, Sam ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; PROBLEM SOLVING;

EQUATIONAL THEORY; EXTENSIONAL REWRITING; REWRITING THEORY;

NUMERICAL METHODS;

EID: 38149117110     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73228-0_19     Document Type: Conference Paper

References (11)

1. Altenkirch, T., Dybjer, P., Hofmann, M., Scott, P.: Normalization by evaluation for typed lambda calculus with coproducts. In: 16th Annual IEEE Symposium on Logic in Computer Science, Boston, Massachusetts, June 2001, pp. 303-310 (2001)
2. Balat, V., Cosmo, R.D., Fiore, M.: Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums. In: 31st Symposium on Principles of Programming Languages (POPL 2004), January 2004, pp. 64-76. ACM Press, New York (2004)
3. Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. Studies in Logics and the Foundations of Mathmatics, vol. 103. North Holland, Amsterdam (1984)
4. Berger, U., Eberl. M., Schwichtenberg, H.: Normalization by evaluation. In: Möller, B., Tucker, J.V. (eds.) Prospects for Hardware Foundations. LNCS, vol. 1546, pp. 117-137. Springer, Heidelberg (1998)
5. Ghani, N.: Beta-eta equality for coproducts. In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol. 902, pp. 171-185. Springer, Heidelberg (1995)
6. Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge University Press, Cambridge (1989)
7. Huet, G.P.: Confluent reductions: Abstract properties and applications to term rewriting systems. J. ACM 27(4), 797-821 (1980)
8. Lindley, S.: Normalisation by Evaluation in the Compilation of Typed Functional Programming Languages. PhD thesis, University of Edinburgh (2005)
9. Lindley, S., Stark, I.: Reducibility and ⊤⊤-lifting for computation types. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol. 3461, pp. 262-277. Springer, Heidelberg (2005)
10. Ohta, Y., Hasegawa, M.: A terminating and confluent linear lambda calculus. RTA, pp. 166-180 (2006)
11. Prawitz, D.: Ideas and results in proof theory. In: Proceedings of the 2nd Scandinavian Logic Symposium. Studies in Logics and the Foundations of Mathmatics, vol. 63, pp. 235-307. North Holland, Amsterdam (1971)