Meaningless terms in rewriting

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

Volumn 1139, Issue , 1996, Pages 254-268

  Kennaway, Richard ^a   van Oostrom, Vincent ^b   de Vries, Fer Jan ^c  

^a UNIVERSITY OF EAST ANGLIA   (United Kingdom)

^b Kashino Diverse Brain Research Laboratory of NTT Communication Science Laboratories   (Japan)

^c HITACHI LTD   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CALCULATIONS; DIFFERENTIATION (CALCULUS); LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE;

AXIOMATIC APPROACH; GENERICITY; LAMBDA CALCULUS; TERM REWRITING; TWO WAYS;

COMPUTER CIRCUITS;

EID: 84944040258     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61735-3_17     Document Type: Conference Paper

References (18)

1. S. Abramsky, D. M. Gabbayl and T. S. E. Maibanm, editors. Handbook of Logic in Computer Science, volume 2, Background: Computational Structures. Oxford University Press, New York, 1992.
2. Z.M. Ariola, J. R. Kennaway, J. W. Klop, M. R. Sleep, and F. J. de Vries. Syntactic definitions of undefined: On defining the undefined. In Int. Syrup. on Theoretical Aspects of Computer Software, Sendai, pages 543-554, 1994. Lecture Notes in Computer Science, vol. 789.
3. H.P. Baxendregt. The Lambda Calculus, Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. Elsevier Science Publishers B.V., Amsterdam, revised edition, 1984.
4. H.P. Barendregt. Representing 'undefined' in lambda calculus. Journal of Functional Programming, 2(3):367-374, July 1992.
5. A. Berarducci. Infinite λ-calculus and non-sensible models. Presented to the conference in honour of Roberto Magari, Siena 1994.
6. A. Church. The Calculi of Lambda Conversion. Princeton University Press, 1941.
7. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In [Lee90, Ch. 6 pp. 243-320], 1990.
8. J.R. Hindley and J. P. Seldin. Introduction to Combinators and λ-Calculus, volume 1 of London Mathematical Society Students Texts. Cambridge University Press, 1986.
9. J.G. Jacopini and M. Venturini Zilli. Easy terms in the lambda calculus. Fundamenta Informaticae, 8, 1985.
10. J. R. Kennaway, J. W. Klop, M. R. Sleep, and F. J. de Vries. Infinitary lambda calculus and Böhm models. In Proc. Conference on Rewriting Techniques and Applications, pages 257-270, 1995. Lecture Notes in Computer Science, vol. 914.
11. J. R. Kennaway, J. W. Klop, M. R. Sleep, and F. J. de Vries. Transfinite reductions in orthogonal term rewriting systems. Information and Computation, 119:18-38, 1995.
12. J.R. Kennaway, J.W. Klop, M. R. Sleep, and F. J. de Vries. Infinitary lambda calculus. Th. Comp. Sci., 1996. to appear.
13. J.W. Klop. Term rewriting systems. In [AGM92, pp. 1-116], 1992.
14. J. Kuper. Partiality in Logic and Computation, Aspects of Undefinedness. PhD thesis, Universiteit Twente, February 1994.
15. J. Kuper. Proving the Genericity Lemma by leftmost reduction is simple. In Proc. Conference on Rewriting Techniques and Applications, pages 271-278, 1995. Lecture Notes in Computer Science, vol. 914.
16. J.R. Kennaway, V. van Oostrom, and F. J. de Vries. abc-active terms in transfinite lambda calculus. Awailable by ftp from ftp://flp.sys.uva.ac.uk/pub/kennaway/publications/abcaetive.dvi, 1996
17. J. van Leeuwen, editor. Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics. Elsevier Science Publishers B.V., Amsterdam, 1990.
18. C.-H. L. Ong. The Lazy Lambda Calculus: An Investigation into the Foundations of Functional Programming. PhD thesis, Imperial College of Science and Technology, University of London, May 1988.