Abstract

This paper formalises within first-order logic some common practices in computer science to do with representing and reasoning about syntactical structures involving named bound variables (as opposed to nameless terms, explicit substitutions, or higher order abstract syntax). It introduces Nominal Logic, a version of first-order many-sorted logic with equality containing primitives for renaming via name-swapping and for freshness of names, from which a notion of binding can be derived. Its axioms express...

Citations

257	Semantics of programming languages: structures and techniques. Foundations of Computing - Gunter - 1992
174	A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13 - GABBAY, PITTS - 2001
160	Isabelle: A Generic Theorem Prover, volume 828 - Paulson - 1994
137	The Lambda Calculus: Its Syntax and Semantics. North-Holland, revised edition - Barendregt - 1984
136	de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem - G - 1972
130	Abstract syntax and variable binding - Fiore, Plotkin, et al. - 1999
127	A new approach to abstract syntax involving binders - GABBAY, PITTS - 1999
121	A spatial logic for concurrency (Part I - Caires, Cardelli - 2001
117	Primitive recursion for higher-order abstract syntax - Schürmann, Despeyroux, et al. - 2001
84	Reasoning with higher-order abstract syntax in a logical framework - McDowell, Miller - 2002
63	The axiom of choice - Jech - 1973
50	A Spatial Logic for Concurrency (Part II - Caires, Cardelli - 2002
49	Five axioms of alpha conversion - Gordon, Melham
43	Logical Properties of Name Restriction - Cardelli, Gordon - 2001
38	First order categorical logic - Makkai, Reyes - 1977
32	A Spatial Logic for Concurrency - Caires, Cardelli
25	A Compact Representation of Proofs - Miller - 1987
21	An axiomatic approach to metareasoning on systems in higher-order abstract syntax - Honsell, Miculan, et al. - 2001
18	Foundations of Constructive Mathematics. Ergebnisse der Mathematik und ihrer Grenzgebiete; 3.Folge, Band 6 - Beeson - 1985
18	An axiomatic approach to metareasoning on nominal algebras in HOAS, in - Honsell, Miculan, et al.
17	Elementary structures in process theory (1): Sets with renaming - Honda - 2000
15	A theory of inductive definitions with α-equivalence: Semantics, implementation, programming language - Gabbay - 2000
12	Developing (meta)theory of lambda-calculus in the theory of contexts - Miculan
11	FM-HOL, a higher-order theory of names - GABBAY - 2002
11	Some Type Theory and Lambda Calculus Formalised - McKinna, Pollack - 1999
8	The axiom of choice - Freyd - 1980
5	A logic programming language based on binding algebras, in - Hamana
3	A Theory of Inductive De with -Equivalence: Semantics, Implementation, Programming Language - Gabbay - 2000
3	HOL-lambda-sigma: an intentional expression of higher-order logic - Dowek, Hardin, et al. - 2001
3	Partial inductive de - Hallnas - 1991
1	A completeness theorem for an extension of logic with binders - Dowek, Hardin, et al. - 2001
1	Endliche Gruppen I, volume 134 of Grundlehren Math - Huppert - 1967
1	A completeness theorem for an extension of first-order logic with binders - Dowek, Hardin, et al. - 2001