
...tution. this seemingly innocuous operation — substituting a variable for a term or valuating a...ignored it. we show that fraenkelmostowski set theory gives a model of variables and substitution as constructions on sets. thus models of variables and substitution are exhibited as constructions in...

...logic with equality containing primitives for renaming via nameswapping, for freshness of names, and for namebinding. its axioms express...same time providing a sufficient foundation for a theory of structural induction/recursion for syntax modulo αequivalence. secondly, it is useful for the practice of operational semantics...

fraenkelmostowski (fm) set theory delivers a...theory models captureavoiding subsitution for names in much the same way as it models alphaequivalence; as an operation valid for the entire sets universe which...

...fm (fraenkelmostowski) set theory techniques were developed...y, but to ‚y0:y for some 'fresh', 'local' y0. the underlying function is captureavoiding substitution (y=x)‚x:y which...

...a methodology of using fm (fraenkel mostowski) sets, and the ideas of...by developing a domain theory for con currency within fm sets the domain theory inherits types and operations for name generation, essentially without disturbing...

...updated development of the sets foundations of nominal techniques, taking into...

...this general formulation provides the foundation for their work on
variable binding...variable binding and variable binding for other binders and for mixtures of binders
as for instance in the logic of...

...order logic which provides support for reasoning about bound names in...develop a new sequent calculus for nominal logic in which the rules for the new quantifier are much...

...alphaequivalence and captureavoiding substitution. we present oneanda...and also as a theoretical foundation for future implementation....

...binding) to define a framework for trace semantics with dynamic allocation...