A rewriting calculus for cyclic higher-order term graphs

Electronic Notes in Theoretical Computer Science

Volumn 127, Issue 5, 2005, Pages 21-41

  Bertolissi, C ^a   Baldan, P ^b   Cirstea, H ^a   Kirchner, C ^a  

^a LORIA   (France)

^b CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

Cyclic lambda calculus; Matching and unification constraints; Rewriting calculus; Term graphs

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; DATA STRUCTURES; MATHEMATICAL OPERATORS; MATHEMATICAL TRANSFORMATIONS; THEOREM PROVING;

CYCLIC LAMBDA CALCULUS; MATCHING AND UNIFICATION CONSTRAINTS; REWRITING CALCULUS; TERM GRAPHS;

GRAPH THEORY;

EID: 18544371791     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.01.034     Document Type: Conference Paper

References (24)

1. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Levy Explicit substitutions Journal of Functional Programming 4 1 1991 375 416
2. Z.M. Ariola, and J.W. Klop Equational term graph rewriting Foundamenta Informaticae 26 3-4 1996 207 240
3. Z.M. Ariola, and J.W. Klop Lambda calculus with explicit recursion Journal of Information and Computation 139 2 1997 154 233
4. H.P. Barendregt The Lambda-Calculus, its syntax and semantics Second edition Studies in Logic and the Foundation of Mathematics 1984 Elsevier Science Publishers B.V. (North-Holland) Amsterdam
5. G. Barthe, H. Cirstea, C. Kirchner, and L. Liquori Pure Patterns Type Systems Proceedings of POPL'03: Principles of Programming Languages, New Orleans, USA, volume 38 2003 ACM 250 261
6. S. Blom. Term Graph Rewriting - Syntax and Semantics. PhD thesis, Vrije Universiteit Amsterdam, 2001
7. H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, and M.R. Sleep Term graph rewriting Proceedings of PARLE'87, Parallel Architectures and Languages Europe Lecture Notes in Computer Science volume 259 1987 Springer-Verlag Eindhoven 141 158
8. A. Corradini and F. Drewes. (Cyclic) term graph rewriting is adequate for rational parallel term rewriting. Technical Report TR-97-14, Dipartimento di Informatica, Pisa, 1997
9. H. Cirstea, G. Faure, and C. Kirchner A rho-calculus of explicit constraint application Proceedings of WRLA'04, the 5th Workshop on Rewriting Logic and Applications, Barcelona, Spain Electronic Notes in Theoretical Computer Science 2004
10. A. Corradini, and F. Gadducci Rewriting on cyclic structures: Equivalence of operational and categorical descriptions Theoretical Informatics and Applications 33 1999 467 493
11. rhoCalIGLP-I+II-2001 H. Cirstea, and C. Kirchner The rewriting calculus - Part I and II Logic Journal of the Interest Group in Pure and Applied Logics 9 3 May 2001 427 498
12. H. Cirstea, C. Kirchner, and L. Liquori Matching Power A. Middeldorp Proceedings of RTA'01, Rewriting Techniques and Applications Lecture Notes in Computer Science volume 2051 May 2001 Springer-Verlag Utrecht, The Netherlands 77 92
13. H. Cirstea, C. Kirchner, and L. Liquori Rewriting calculus with(out) types F. Gadducci U. Montanari Proceedings of WRLA'02, the 4th Workshop on Rewriting Logic and Applications, Pisa (Italy) Electronic Notes in Theoretical Computer Science 71 September 2002
14. H. Cirstea, L. Liquori, and B. Wack Rewriting calculus with fixpoints: Untyped and first-order systems S. Berardi M. Coppo F. Damian Types for Proofs and Programs (TYPES), Torino (Italy) Lecture Notes in Computer Science volume 3085 May 2003 147 171
15. A. Corradini Term rewriting in C T Σ M.C. Gaudel J.P. Jouannaud Proceedings of TAPSOFT'93, Theory and Practice of Software Development / 4th International Joint Conference CAAP/FASE 1993 Springer Berlin, Heidelberg 468 484
16. W. Kahl Relational treatment of term graphs with bound variables Logic Journal of the Interest Group in Pure and Applied Logics 6 2 1998 259 303
17. J.R. Kennaway, J.W. Klop, M.R. Sleep, and F.J. de Vries Transfinite reductions in orthogonal term rewriting systems Proceedings of RTA'91 (International Conference on Rewriting Techniques and Applications) 1991 1 12 also Report CS-R9041, CWI, 1990
18. J.R. Kennaway, J.W. Klop, M.R. Sleep, and F.J. de Vries On the adequacy of graph rewriting for simulating term rewriting ACM Transactions on Programming Languages and Systems 16 3 May 1994 493 523
19. J.R. Kennaway, J.W. Klop, M.R. Sleep, and F.J. de Vries Infinitary lambda calculus Theoretical Computer Science 175 1 1997 93 125
20. M. Parigot λμ-calculus: An algorithmic interpretation of classical natural deduction A. Voronkov Proceedings of LPAR'92, Logic Programming and Automated Reasoning, St Petersburg, Russia, July 1992 Lecture Notes in Artificial Intelligence volume 624 1992 Springer-Verlag Berlin 190 201
21. S.L. Peyton-Jones The implementation of functional programming languages 1987 Prentice-Hall International
22. M.R. Sleep M.J. Plasmeijer M.C.J.D. van Eekelen Term graph rewriting: theory and practice 1993 Wiley London
23. D.A. Turner A new implementation technique for applicative languages Software Practice and Experience 9 1979 31 49
24. V. van Oostrom. Lambda Calculus with Patterns. Technical Report IR-228, Faculteit der Wiskunde en Informatica, Vrije Universiteit Amsterdam, 1990