Notions of computation and monads
Information and Computation
A syntactic approach to type soundness
Information and Computation
Handbook of logic in computer science (vol. 3)
Operational reasoning for functions with local state
Higher order operational techniques in semantics
Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Operational Semantics and Program Equivalence
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
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
Nominal Games and Full Abstraction for the Nu-Calculus
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Denotational semantics for a program logic of objects
Mathematical Structures in Computer Science
Alpha-structural recursion and induction
Journal of the ACM (JACM)
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Sequentiality and the CPS Semantics of Fresh Names
Electronic Notes in Theoretical Computer Science (ENTCS)
A general mathematics of names
Information and Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Free-algebra models for the π -calculus
Theoretical Computer Science
Cryptographic logical relations
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Interpreting Localized Computational Effects Using Operators of Higher Type
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
One-and-a-Halfth Order Terms: Curry-Howard and Incomplete Derivations
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relational parametricity and separation logic
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
On normalization by evaluation for object calculi
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
A realizability model for impredicative Hoare type theory
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
A Nominal Relational Model for Local Store
Electronic Notes in Theoretical Computer Science (ENTCS)
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
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Stone duality for nominal Boolean algebras with И
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Separation logic for higher-order store
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Completeness of global evaluation logic
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Alpha-structural recursion and induction
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Relational reasoning in a nominal semantics for storage
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Monad-Based logics for computational effects
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Relational reasoning for recursive types and references
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Encoding Abstract Syntax Without Fresh Names
Journal of Automated Reasoning
Full abstraction for nominal Scott domains
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
A standard monad of continuations, when constructed with domains in the world of FM-sets [M.J. Gabbay, A.M. Pitts, A new approach to abstract syntax with variable binding, Formal Aspects Comput. 13 (2002) 341-363], is shown to provide a model of dynamic allocation of fresh names that is both simple and useful. In particular, it is used to prove that the powerful facilities for manipulating fresh names and binding operations provided by the "Fresh" series of metalanguages [M.R. Shinwell, Swapping the atom: Programming with binders in Fresh O'Caml, Proc. MERλIN, 2003; M.R. Shinwell, A.M. Pitts, Fresh O'Caml User Manual, Cambridge University Computer Laboratory, September 2003, available at 〈http://www.freshml.org/foc/〉 M.R. Shinwell, A.M. Pitts, M.J. Gabbay, FreshML: Programming with binders made simple, in: Proc. ICFP '03, ACM Press, 2003, pp. 263-274] respect α-equivalence of object-level languages up to meta-level contextual equivalence.