Combinatory reduction systems with explicit substitution that preserve strong normalisation

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

Volumn 1103, Issue , 1996, Pages 169-183

  Bloo, Roel ^a   Rose, Kristoffer H ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS;

COMBINATORY REDUCTION SYSTEMS; EXPLICIT SUBSTITUTIONS; HIGHER-ORDER PROGRAMS; HIGHER-ORDER REWRITING; LAMBDA CALCULUS; OPERATIONAL PROPERTIES; REDUCTION STRATEGY; STRUCTURE-PRESERVING;

DIFFERENTIATION (CALCULUS);

EID: 84957657852     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61464-8_51     Document Type: Conference Paper

References (17)

1. Abàdi, M., Cardelli, L., Curien, P.-L. and Levy, J.-J. (1991). Explicit substitutions. Journal of Functional Programming 1(4): 375-416.
2. Aczel, P. (1978). A general Church-Rosser theorem. Technical report. Univ. of Manchester.
3. Ariola, Z. M. and Klop, J. W. (1994). Cyclic lambda graph rewriting. Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press. Paris, Prance, pp. 416-425. full version forthcoming (Ariola and Klop 1995).
4. Ariola, Z. M. and Klop, J. W. (1995). Lambda calculus with explicit recursion. Personal Communication.
5. Barendregt, H. P. (1984). The Lambda Calculus: Its Syntax and Semantics. Revised edn. North-Holland.
6. Bloo, R. and Rose, K. H. (1995). Preservation of strong normalisation in named lambda calculi with explicit substitution and garbage collection. CSN '95 - Computer Science in the Netherlands, pp. 62-72. (url: ftp://ftp.diku.dk/diku/semantics/papers/ D-246.ps)
7. de Bruijn, N. G. (1972). Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation with application to the Church-Rosser theorem. Koninklijke Nederlandse Akademie van Wetenschappen, Series A, Mathematical Sciences 75: 381-392. Also chapter C.2 of (Nederpelt, Geuvers and de Vrijer 1994).
8. Duggan, D. (1993). Higher-order substitution. UW TR CS-93-44. Dept, of Computer Science, University of Waterloo. Waterloo, Ontario, Canada N2L 3G1. (url)
9. Klop, J. W. (1980). Combinatory Reduction Systems. PhD thesis. University of Utrecht. Also available as Mathematical Centre Tracts 127.
10. Klop, J. W., van Oostrom, V. and van Raamsdonk, F. (1993). Combinatory reduction systems: Introduction and survey. Theoretical Computer Science 121: 279-308.
11. Landin, P. J. (1964). The mechanical evaluation of expressions. Computer Journal 6: 308-320.
12. Melliès, P.-A. (1995). Typed λ-calculi with explicit substitution may not terminate. In Dezani, M. (ed.), Int. Conf. on Typed Lambda Calculus and Applications. LNCS. U of Edinburgh. Springer-Verlag. Edinburgh, Scotland, pp. 328-334.
13. Nederpelt, R. P., Geuvers, J. H. and de Vrijer, R. C. (eds) (1994). Selected Papers on Automath. Vol. 133 of Studies in Logic. North-Holland.
14. Nipkow, T. (1991). Higher-order critical pairs. Proceedings, Sixth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press. Amsterdam, The Netherlands, pp. 342-349.
15. Rose, K. H. (1992). Explicit cyclic substitutions. In Rusinowitch, M. and Rémy, J.- L. (eds), CTRS '92-3rd International Workshop on Conditional Term Rewriting Systems. Number 656 in LNCS. Springer-Verlag. Pont-a-Mousson, France, pp. 36- 50. (URL)
16. Rose, K. H. (1996). Operational Reduction Models for Functional Programming Languages. PhD thesis. DIKU (University of Copenhagen). Universitetsparken 1, DK- 2100 København 0. DIKU report 96/1.
17. van Oostrom, V. and van Raamsdonk, F. (1995). Weak orthogonality implies confluence: the higher-order case. Technical Report CS-R9501. CWI.