18 search results - page 1 / 4 » Nominal Logic: A First Order Theory of Names and Binding |
TACS
2001
Springer
13 years 9 months ago
2001
Springer
ICFP
2005
ACM
14 years 5 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
PPDP
2010
Springer
13 years 3 months ago
2010
Springer
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
PPDP
2004
Springer
13 years 10 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...
ICFP
2010
ACM
13 years 6 months ago
2010
ACM
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...