Nominal rewriting

Information and Computation

Volumn 205, Issue 6, 2007, Pages 917-965

  Fernández, Maribel ^a   Gabbay, Murdoch J ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Binders; Confluence; First and higher order rewriting; Conversion

Indexed keywords

BINDERS; CALCULATIONS; DIFFERENTIATION (CALCULUS);

ALPHA-EQUIVALENCE; CONFLUENCE; FIRST AND HIGHER-ORDER REWRITING; FIRST ORDER CHARACTER; FIRST-ORDER REWRITING; LAMBDA CALCULUS; ORTHOGONAL SYSTEMS; REWRITING ALGORITHM;

BINS;

EID: 84855202240     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2006.12.002     Document Type: Article

References (43)

1. M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Lévy, Explicit substitutions, Journal of Functional Programming 1(4) (1991) 375-416.
2. F. Baader, T. Nipkow, Term Rewriting and All That, Cambridge University Press, Great Britain, 1998.
3. F. Barbanera, M. Fernández, H. Geuvers, Modularity of strong normalization in the algebraic-λ-cube, Journal of Functional Programming 6(1997) 613-660.
4. F. Barbanera, M. Fernández, Intersection type assignment systems with higher-order algebraic rewriting, Theoretical Computer Science 170(1996) 173-207. (Pubitemid 126411633)
5. H. P. Barendregt, Pairing without conventional constraints, Zeitschrift für mathematischen Logik und Grundlagen der Mathematik 20(1974) 289-306.
6. H. P. Barendregt, The Lambda Calculus: Its Syntax and Semantics (revised ed.), Studies in Logic and the Foundations of Mathematics, vol. 103, North-Holland, Amsterdam, 1984.
7. J. Bergstra, J. W. Klop, Conditional rewrite rules: confluence and termination, Journal of Computer and System Sciences 32(3) (1986) 323-362. (Pubitemid 16630745)
8. R. Bloo, K. Rose, Preservation of strong normalisation in named lambda calculi with explicit substitution and garbage collection, Computer Science Conference, The Netherlands, 1995.
9. E. Bonelli, D. Kesner, A. Ríos, From higher-order to first-order rewriting, in: Proceedings of the 12th International Conference of Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 2051, Springer, 2001.
10. V. Breazu-Tannen, J. Gallier, Polymorphic rewriting conserves algebraic strong normalization, Theoretical Computer Science 83(1) (1991).
11. V. Breazu-Tannen, J. Gallier, Polymorphic rewriting conserves algebraic confluence, Information and Computation 82(1992) 3-28. (Pubitemid 21677689)
12. C. Calves, M. Fernández, Implementing nominal unification, in: Proceedings of TERMGRAPH'06, 3rd International Workshop on Term Graph Rewriting, ETAPS 2006, Vienna, Electronic Notes in Computer Science, Elsevier, 2006.
13. J. Cheney. The complexity of equivariant unification, in: Automata, Languages and Programming, Proceedings of the 31st International Colloquium, ICALP 2004, Lecture Notes in Computer Science, vol. 3142, Springer, 2004.
14. H. Cirstea, C. Kirchner, The rewriting calculus - Part I. Logic Journal of the Interest Group in Pure and Applied Logics, 9(2001) 363-399. Also available as Technical Report A01-R-203, LORIA, Nancy (France).
15. H. Cirstea, C. Kirchner, The Rewriting Calculus - Part II. Logic Journal of the Interest Group in Pure and Applied Logics, 9(2001) 401-434. Also available as Technical Report A01-R-204, LORIA, Nancy (France).
16. R. David, B. Guillaume, A λ.-calculus with explicit weakening and explicit substitution, Mathematical Structures in Computer Science 11(1) (2001) 169-206.
17. N. Dershowitz, J.-P. Jouannaud, Rewrite systems, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science: Formal Methods and Semantics, vol. B, North-Holland, 1989.
18. D. J. Dougherty. Adding algebraic rewriting to the untyped lambda calculus, in: Proceedings of the 4th International Conference Rewriting Techniques and Applications, Como, Italy, Lecture Notes in Computer Science, vol. 488, Springer, 1991.
19. M. Fernández, M. J. Gabbay, Nominal rewriting with name generation: abstraction vs. locality, in: Proceedings of the 7th ACM-SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP'05), Lisbon, Portugal, ACM Press, 2005.
20. M. Fernández, M. J. Gabbay, Curry style types for nominal terms, in: Proceedings of the International Workshop TYPES 2006, Lecture Notes in Computer Science, Springer, 2007 (in press).
21. M. Fernández, M. J. Gabbay, I. Mackie, Nominal rewriting systems, in: Proceedings of the 6th ACM-SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP'04), Verona, Italy, ACM Press, 2004.
22. M. Fernández, J.-P. Jouannaud, Modular termination of term rewriting systems revisited. Recent Trends in Data Type Specification, in: Proceedings of 10th Workshop on Specification of Abstract Data Types (ADT'94), Santa Margherita, Italy, Lecture Notes in Computer Science, vol. 906, Springer, 1995.
23. M. Fernández, I. Mackie, F.-R. Sinot, Closed reduction: explicit substitutions without alpha-conversion, Mathematical Structures in Computer Science 15(2) (2005).
24. M. J. Gabbay, A. M. Pitts, A new approach to abstract syntax involving binders, in: 14th Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, 1999, pp. 214-224.
25. M. J. Gabbay, A. M. Pitts, A new approach to abstract syntax with variable binding, Formal Aspects of Computing 13(2001) 341-363. (Pubitemid 41204157)
26. M. J. Gabbay, A theory of inductive definitions with alpha-equivalence. Ph. D. Thesis, University of Cambridge, 2001.
27. M. Hamana, Term rewriting with variable binding: an initial algebra approach, in: 5th ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP 2003), ACM Press, 2003.
28. J.-P. Jouannaud, M. Okada, Executable higher-order algebraic specification languages, in: Proceedings, Sixth Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 1991, pp. 350-361. (Pubitemid 21691969)
29. Z. Khasidashvili, V. van Oostrom, Context sensitive conditional reduction systems, in: Proceedings of SEGRA-GRA'95, Electronic Notes in Theoretical Computer Science, 2, 1995.
30. Z. Khasidashvili, Expression reduction systems, in: Proceedings of I. Vekua Institute of Applied Mathematics, Tbilisi, vol. 36, 1990, pp. 200-220.
31. J.-W. Klop, V. van Oostrom, F. van Raamsdonk, Combinatory reduction systems, introduction and survey, Theoretical Computer Science 121(1993) 279-308.
32. P. Lescanne, From λσ to λu a journey through calculi of explicit substitutions. in: Proceedings of the 21st ACM Symposium on Principles of Programming Languages (POPL'94), ACM Press, 1994.
33. R. Mayr, T. Nipkow, Higher-order rewrite systems and their confluence, Theoretical Computer Science 192(1998) 3-29. (Pubitemid 128458423)
34. M. H. A. Newman, On theories with a combinatorial definition of equivalence, Annals of Mathematics 43(2) (1942) 223-243.
35. B. Pagano, Des calculs de substitution explicite et de leur application à la compilation des langages fonctionnels, Ph. D. Thesis, Université de Paris, 6, 1998.
36. AM. Pitts, Nominal logic, a first order theory of names and binding. Information and Computation, 186(2003) 165-193.
37. Preliminary version in Proceedings of 4th International Symposium on Theoretical Aspects of Computer Software (TACS 2001), Lecture Notes in Computer Science, vol. 2214, Springer, 2001.
38. F. van Raamsdonk, Confluence and normalisation for higher-order rewriting, Ph. D. Thesis, Free University of Amsterdam, 1996.
39. M. R. Shinwell, A. M. Pitts, M. J. Gabbay, FreshML: programming with binders made simple, in: 8th ACM SIG-PLAN International Conference on Functional Programming (ICFP 2003), Uppsala, Sweden, ACM Press, 2003, pp. 263-274.
40. M. Takahashi, λ-calculi with conditional rules, in: J. F. Groote, M. Bezem (Eds.), Typed Lambda Calculi and Applications, International Conference TLCA'93, Lecture Notes in Computer Science, vol. 664, Springer-Verlag, Berlin, 1993.
41. C. Urban, A. M. Pitts, M. J. Gabbay, Nominal unification, in: M. Baaz (Ed.), Computer Science Logic and 8th Kurt Gödel Colloquium (CSL'03 & KGC), Vienna, Austria. Proceedings, Lecture Notes in Computer Science, vol. 2803, Springer-Verlag, Berlin, 2003, pp. 513-527.
42. C. Urban, A. M. Pitts, M. J. Gabbay, Nominal unification, Theoretical Computer Science 323(2004) 473-497.
43. C. Urban, J. Cheney, Avoiding equivariance in alpha-prolog, in: Proceedings of Typed Lambda Calculus and Applications, TLCA 2005, pp. 401-416. (Pubitemid 41312731)