Nominal unification

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

Volumn 2803, Issue , 2003, Pages 513-527

  Urban, Christian ^a   Pitts, Andrew ^a   Gabbay, Murdoch ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; BINS;

ALGORITHMIC PROPERTIES; ALPHA-EQUIVALENCE; BINDING OPERATIONS; EXPLICIT SUBSTITUTIONS; GENERAL SOLUTIONS; GENERALISATION; UNIFICATION ALGORITHMS; UNIFICATION PROBLEM; FIRST ORDER;

BINDERS; PROBLEM SOLVING;

EID: 35248880596     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45220-1_41     Document Type: Article

References (27)

1. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
2. H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, 1984.
3. L. Caires and L. Cardelli. A spatial logic for concurrency II. In Proc. of CONCUR 2002, volume 2421 of LNCS, pages 209-225. Springer-Verlag, 2002.
4. L. Cardelli, P. Gardner, and G. Ghelli. Manipulating trees with hidden labels. In Proc. of FOSSACS, volume 2620 of LNCS, pages 216-232. Springer-Verlag, 2003.
5. I. Cheney and C. Urban. αProlog, a fresh approach to logic programming modulo α-equivalence. In Proc. of UNIF 2003, number DSIC-II/12/03 in Departamento de Sistemas Informáticos y Computación Technical Report Series. Universidad Politécnica de Valencia, 2003.
6. G. Dowek. Higher-order unification and matching. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, chapter 16, pages 1009-1062. Elsevier, 2001.
7. G. Dowek, T. Hardin, and C. Kirchner. Higher-order unification via explicit substitutions. In 10th Symposium of LICS, pages 366-374. IEEE Computer Society Press, 1995.
8. G. Dowek, T. Hardin, C. Kirchner, and F. Pfenning. Higher-order unification via explicit substitutions: the case of higher-order patterns. In Proc. of JICSLP, pages 259-273, 1996.
9. M. P. Fiore, G. D. Plotkin, and D. Turi. Abstract syntax and variable binding. In 14th Symposium of LICS, pages 193-202. IEEE Computer Society Press, 1999.
10. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax involving binders. In 14th Symposium of LICS, pages 214-224. IEEE Computer Society Press, 1999.
11. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2002.
12. C. A. Gunter. Semantics of Programming Languages: Structures and Techniques. Foundations of Computing. MIT Press, 1992.
13. M. Hamana. A logic programming language based on binding algebras. In Proc. of TACS 2001, volume 2215 of LNCS, pages 243-262. Springer-Verlag, 2001.
14. 0-unification for terms with context holes. In Proc. of UNIF 2002, 2002. Unpublished proceedings.
15. M. Hashimoto and A. Ohori. A typed context calculus. TCS, 266:249-271, 2001.
16. F. Honsell, M. Miculan, and I. Scagnetto. An axiomatic approach to metareasoning on nominal algebras in HOAS. In Proc. of ICALP 2001, volume 2076 of LNCS, pages 963-978. Springer-Verlag, 2001.
17. J. W. Klop. Term rewriting systems. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, Volume 2, pages 1-116. OUP, 1992.
18. A. Martelli and U. Montanari. An efficient unification algorithm. ACM Trans. Programming Languages and Systems, 4(2):258-282, 1982.
19. S. Michaylov and F. Pfenning. An empirical study of the runtime behaviour of higher-order logic programs. In Proc. Workshop on the λProlog Programming Language, pages 257-271, 1992. CIS Technical Report MS-CIS-92-86.
20. D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, 1:497-536, 1991.
21. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes (parts I and II). Information and Compulation, 100:1-77, 1992.
22. F. Pfenning and C. Elliott. Higher-order abstract syntax. In Proc. ACM-SIGPLAN Conference on Programming Language Design and Implementation, pages 199-208. ACM Press, 1988.
23. A. M. Pitts. Nominal logic: A first order theory of names and binding. In Proc. of TACS 2001, volume 2215 of LNCS, pages 219-242. Springer-Verlag, 2001.
24. A. M. Pitts and M. J. Gabbay. A metalanguage for programming with bound names modulo renaming. In Proc. of MPC2000, volume 1837 of LNCS, pages 230-255. Springer-Verlag, 2000.
25. G. D. Plotkin. An illative theory of relations. In Situation Theory and its Applications, volume 22 of CSLI Lecure Notes, pages 133-146. Stanford University, 1990.
26. M. Sato, T. Sakurai, and Y. Kameyama. A simply typed context calculus with first-class environments. Journal of Functional and Logic Programming, 2002(4), 2002.
27. M. R. Shinwell, A. M. Pitts, and M. J. Gabbay. FreshML: Programming with binders made simple. In Proc. of ICFP 2003. ACM Press, 2003.