8 search results - page 2 / 2 » A fresh look at programming with names and binders |
POPL
2010
ACM
15 years 7 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
ACSD
2008
IEEE
15 years 4 months ago
2008
IEEE
PICNIC is a tool for verifying security properties of systems, namely non-interference properties of processes expressed as terms of the π-calculus with two security levels and d...
PPDP
2004
Springer
15 years 3 months ago
2004
Springer
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...