Notes on logic and set theory
A calculus of mobile processes, II
Information and Computation
Some Lambda Calculus and Type Theory Formalized
Journal of Automated Reasoning
A Fixedpoint Approach to Implementing (Co)Inductive Definitions
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
A New Approach to Abstract Syntax Involving Binders
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
History-Dependent Automata
FreshML: programming with binders made simple
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Nominal logic, a first order theory of names and binding
Information and Computation - TACS 2001
On a monadic semantics for freshness
Theoretical Computer Science - Applied semantics: Selected topics
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Freshness and name-restriction in sets of traces with names
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Theoretical Computer Science
Permissive-nominal logic: First-order logic over nominal terms and sets
ACM Transactions on Computational Logic (TOCL)
PNL to HOL: From the logic of nominal sets to the logic of higher-order functions
Theoretical Computer Science
Game Semantics in the Nominal Model
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We introduce FMG (Fraenkel-Mostowski Generalised) set theory, a generalisation of FM set theory which allows binding of infinitely many names instead of just finitely many names. We apply this generalisation to show how three presentations of syntax-de Bruijn indices, FM sets, and name-carrying syntax-have a relation generalising to all sets and not only sets of syntax trees. We also give syntax-free accounts of Barendregt representatives, scope extrusion, and other phenomena associated to @a-equivalence. Our presentation uses a novel presentation based not on a theory but on a concrete model U.