Hierarchical Nominal Terms and Their Theory of Rewriting

Electronic Notes in Theoretical Computer Science

Volumn 174, Issue 5, 2007, Pages 37-52

  Gabbay, Murdoch J ^a  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

meta theory of logic and programming; Nominal rewriting; nominal techniques

Indexed keywords

COMPUTER SIMULATION; FORMAL LOGIC; MATHEMATICAL TECHNIQUES; SYNTACTICS; THEOREM PROVING;

META-THEORY OF LOGIC AND PROGRAMMING; NOMINAL REWRITING; NOMINAL TECHNIQUES;

HIERARCHICAL SYSTEMS;

EID: 34249033337     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.01.017     Document Type: Article

References (20)

1. Avron A., Honsell F.A., Mason I.A., and Pollack R. Using typed lambda calculus to implement formal systems on a machine. Journal of Automated Reasoning 9 3 (1992)
2. Barwise J. An introduction to first-order logic. In: Barwise J. (Ed). Handbook of Mathematical Logic (1977), North Holland
3. R. Bloo. Preservation of Termination for Explicit Substitution. PhD thesis, Eindhoven University of Technology, Eindhoven, 1997
4. Cheney J., and Urban C. Alpha-prolog: A logic programming language with names, binding and alpha-equivalence. In: Demoen B., and Lifschitz V. (Eds). Proceedings of the 20th International Conference on Logic Programming. (ICLP 2004). LNCS number 3132 (2004), Springer-Verlag
5. M. Fernández, M.J. Gabbay. Nominal rewriting. Information and Computation, 2005. Accepted for publication
6. Gabbay M.J. A new calculus of contexts. Proc. 7th Int. ACM SIGPLAN Conf. on Principles and Practice of Declarative Programming. (PPDP'2005) (2005), ACM
7. Gabbay M.J., and Mathijssen A. Capture-avoiding substitution as a nominal algebra. ICTAC'2006 (2006)
8. M.J. Gabbay, A. Mathijssen. Nominal algebra. Submitted STACS'07, 2006
9. Hindley J.R. Basic Simple Type Theory. Cambridge Tracts in Theoretical Computer Science Number 42 (1997), Cambridge University Press
10. Huet, Kahn, and Paulin-Mohring. The COQ tutorial. http://pauillac.inria.fr/coq/doc/tutorial.html LogiCal Project
11. Lescanne P. From lambda-sigma to lambda-upsilon a journey through calculi of explicit substitutions. POPL '94: Proc. 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (1994), ACM Press
12. Mayr R., and Nipkow T. Higher-order rewrite systems and their confluence. Theoretical Computer Science 192 (1998)
13. Milner R., Parrow J., and Walker D. A calculus of mobile processes. II. Information and Computation 100 1 (1992)
14. Nordstrom B., Petersson K., and Smith J.M. Programming in Martin-Lof's Type Theory. International Series of Monographs on Computer Science vol. 7 (1990), Clarendon Press, Oxford. http://www.cs.chalmers.se/Cs/Research/Logic/book/ Also online at
15. L. Paulson. The Isabelle reference manual. Cambridge University Computer Laboratory, 2001
16. Russell B., and Whitehead A. Principia Mathematica (1910-1912-1913), Cambidge University Press 3 vols.
17. M. Shinwell, A. Pitts. Fresh objective caml user manual. Technical Report UCAM-CL-TR-621, University of Cambridge, 2005
18. Terese. Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science Number 55 (2003), Cambridge University Press
19. Urban C., Pitts A.M., and Gabbay M.J. Nominal unification. Theoretical Computer Science 323 1-3 (2004)
20. van Benthem J. Higher-order logic. In: Gabbay D., and Guenthner F. (Eds). Handbook of Philosophical Logic, vol. 1. 2nd Edition (2001), Kluwer