Notions of computation and monads
Information and Computation
A functional theory of local names
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
Theoretical Computer Science
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
pi-Calculus, Structured Coalgebras, and Minimal HD-Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
A Metalanguage for Programming with Bound Names Modulo Renaming
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Logic of Programs, Workshop
A Fully-Abstract Model for the p-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Semantics of Name and Value Passing
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
A framework for typed HOAS and semantics
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
FreshML: programming with binders made simple
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Nominal Games and Full Abstraction for the Nu-Calculus
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Nominal rewriting with name generation: abstraction vs. locality
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
About permutation algebras, (pre)sheaves and named sets
Higher-Order and Symbolic Computation
On a monadic semantics for freshness
Theoretical Computer Science - Applied semantics: Selected topics
A general mathematics of names
Information and Computation
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets
Theoretical Computer Science
Journal of Logic and Computation
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Comparing operational models of name-passing process calculi
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Symmetries, local names and dynamic (de)-allocation of names
Information and Computation
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Stone duality for nominal Boolean algebras with И
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
On nominal regular languages with binders
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Game Semantics in the Nominal Model
Electronic Notes in Theoretical Computer Science (ENTCS)
A characterisation of languages on infinite alphabets with nominal regular expressions
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
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 |
We use nominal sets (sets with names and binding) to define a framework for trace semantics with dynamic allocation of resources. Using novel constructions in nominal sets, including the technical devices of positive nominal sets and maximal planes, we define notions of capture-avoiding composition and name-restriction on sets of traces with names. We conclude with an extended version of Kleene algebras which summarises in axiomatic form the relevant properties of the constructions.