A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets

Theoretical Computer Science

Volumn 410, Issue 12-13, 2009, Pages 1159-1189

  Gabbay, Murdoch J ^a  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

Fraenkel Mostowski set theory; Nominal techniques; Substitution

Indexed keywords

FUNCTIONS; PROGRAMMING THEORY; SET THEORY; SYNTACTICS;

ALPHA EQUIVALENCES; DATA TYPES; FRAENKEL-MOSTOWSKI SET THEORY; INTUITIONISTIC LOGIC; MATHEMATICAL CONCEPTS; NOMINAL TECHNIQUES; OVERALL DESIGNS; SUBSTITUTION; THEORY MODELS;

EQUIVALENCE CLASSES;

EID: 59849094666     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.11.013     Document Type: Article

References (43)

1. Aczel P. Non-wellfounded set theory. CSLI Lecture Notes no. 14 (1988) CSLI
2. Aczel P. Generalised set theory. CSLI Lecture Notes 1 58 (1996) 1-17
3. Aczel P., and Lunnon R. Universes and parameters. CSLI Lecture Notes 2 (1991) 3-24
4. Barendregt H.P. The Lambda Calculus: its Syntax and Semantics. revised ed. (1984), North-Holland
5. Beeson M. Lambda logic. Second International Joint Conference on Automated Reasoning. IJCAR 2004. Lecture Notes in Computer Science vol. 3097 (2004), Springer 460-474
6. Benton N., and Leperchey B. Relational reasoning in a nominal semantics for storage. Proc. of the 7th Int'l Conf. on Typed Lambda Calculi and Applications. TLCA. Lecture Notes in Computer Science vol. 3461 (2005) 86-101
7. Brunner N. 75 years of independence proofs by Fraenkel-Mostowski permutation models. Mathematica Japonica 43 (1996) 177-199
8. Cheney J., and Urban C. Alpha-prolog: A logic programming language with names, binding and alpha-equivalence. In: Demoen B., and Lifschitz V. (Eds). Proc. of the 20th Int'l Conf. on Logic Programming. ICLP 2004. Lecture Notes in Computer Science no. 3132 (2004), Springer 269-283
9. D. Clarke, R. Hinze, J. Jeuring, A. oh, J. de Wit, The generic haskell user's guide, Technical Report UU-CS-2001-26, November 2001
10. Crabbé M. On the notion of substitution. Logic Journal of the IGPL 12 2 (2004) 111-124
11. Feldman N. Axiomatization of polynomial substitution algebras. Journal of Symbolic Logic 47 3 (1982) 481-492
12. Fine K. Reasoning with Arbitrary Objects (1985), Blackwell
13. Fiore M., and Turi D. Semantics of name and value passing. Proc. 16th LICS Conf. (2001), IEEE, Computer Society Press 93-104
14. Fiore M.~P., Plotkin G.~D., and Turi D. Abstract syntax and variable binding. LICS '99: 14th Annual Symposium on Logic in Computer Science (1999), IEEE 193-202
15. Murdoch J. Gabbay, A theory of inductive definitions with alpha-equivalence, Ph.D. Thesis, Cambridge, UK, 2000. http://www.gabbay.org.uk/papers.html#thesis
16. Gabbay M.~J. The pi-calculus in FM. In: Kamareddine F. (Ed). Thirty-five years of Automath. Kluwer applied logic series vol.~28 (2003), Kluwer 247-269. http://www.gabbay.org.uk/papers.html#picfm
17. Gabbay M.~J. A general mathematics of names. Information and Computation 205 7 (2007) 982-1011. http://www.gabbay.org.uk/papers.html#genmn
18. Gabbay M.~J., and Gabbay M.~J. a-logic. We Will Show Them: Essays in Honour of Dov Gabbay vol.~1 (2005), College Publications. http://www.gabbay.org.uk/papers.html#alog
19. Murdoch J. Gabbay, Martin Hofmann, Nominal renaming sets, in: LPAR'08, 2008. http://www.gabbay.org.uk/papers.html#nomrs
20. Gabbay M.~J., and Mathijssen A. Capture-avoiding substitution as a nominal algebra. ICTAC 2006: Theoretical Aspects of Computing. Lecture Notes in Computer Science vol. 4281 (2006) 198-212. http://www.gabbay.org.uk/papers.html#capasn
21. Gabbay M.~J., and Mathijssen A. One-and-a-halfth-order logic. PPDP '06: Proc. of the 8th ACM SIGPLAN symposium on Principles and Practice of Declarative Programming (2006), ACM 189-200. http://www.gabbay.org.uk/papers.html#oneaah
22. Gabbay M.~J., and Mathijssen A. Capture-avoiding substitution as a nominal algebra. Formal Aspects of Computing 20 4-5 (2008) 451-479. http://www.gabbay.org.uk/papers.html#capasn-jv
23. Gabbay M.~J., and Pitts A.M. A new approach to abstract syntax with variable binding (journal version). Formal Aspects of Computing 13 3-5 (2001) 341-363. http://www.gabbay.org.uk/papers.html#newaas-jv
24. Gabbay M.~J., and Pitts A.~M. A new approach to abstract syntax involving binders. 14th Annual Symposium on Logic in Computer Science (1999), IEEE Computer Society Press 214-224. http://www.gabbay.org.uk/papers.html#newaas
25. CLIP group. CIAO Prolog documentation project. http://www.ciaohome.org
26. Michael Hanus, Sergio Antoy, Herbert Kuchen, Francisco J. López-Fraguas, Wolfgang Lux, Juan José Moreno-Navarro, Frank Steiner, Curry: An integrated functional logic language, 2003
27. Hodges W. Elementary predicate logic. In: Gabbay D.M., and Guenthner F. (Eds). Handbook of Philosophical Logic, Vol.~1. 2nd edition (2001), Kluwer 1-131
28. Hofmann M. Semantical analysis of higher-order abstract syntax. 14th Annual Symposium on Logic in Computer Science (1999), IEEE 204-213
29. Jech T. Set theory. In: Zalta E.~N. (Ed). The Stanford Encyclopedia of Philosophy (2002), Fall
30. Johnstone P.T. Notes on Logic and Set Theory (1987), Cambridge University Press
31. Lämmel R., and Jones S.~P. Scrap your boilerplate: a practical design pattern for generic programming. TLDI (2003), ACM 26-37
32. Lescanne P. From lambda-sigma to lambda-upsilon: a journey through calculi of explicit substitutions. POPL (1994), ACM 60-69
33. Lusin S., and Salibra A. The lattice of lambda theories. Journal of Logic and Computation 14 3 (2004) 373-394
34. Milner R., Parrow J., and Walker D. A calculus of mobile processes, II. Information and Computation 100 1 (1992) 41-77
35. Pitts A.M. Nominal logic, a first order theory of names and binding. Information and Computation 186 2 (2003) 165-193
36. Pitts A.M., and Gabbay M.~J. A metalanguage for programming with bound names modulo renaming. MPC2000. Lecture Notes in Computer Science vol. 1837 (2000), Springer 230-255
37. Salibra A. On the algebraic models of lambda calculus. Theoretical Computer Science 249 1 (2000) 197-240
38. Manfred Schmidt-Schauß, Jörg Siekmann, Unification algebras: An axiomatic approach to unification, equation solving and constraint solving, Technical Report SEKI-report SR-88-09, FB Informatik, Universität Kaiserslautern, 1988
39. Terese. Term rewriting systems. Cambridge Tracts in Theoretical Computer Science no.~55 (2003), Cambridge University Press
40. Truss J. Permutations and the axiom of choice. In: Macpherson H.D., and Kaye R. (Eds). Automorphisms of First Order Structures (1994), OUP 131-152
41. Urban C., Pitts A.~M., and Gabbay M.~J. Nominal unification. Theoretical Computer Science 323 1-3 (2004) 473-497. http://www.gabbay.org.uk/papers.html#nomu-jv
42. van Benthem J. Higher-order logic. Handbook of Philosophical Logic, Vol.~1. 2nd edition (2001), Kluwer 189-244
43. James Williams, Instantiation theory, Technical Report M-90-04, The Mitre Corporation, 1990