52 search results - page 1 / 11 » Algebraic Theories over Nominal Sets |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
MSCS
2010
13 years 3 months ago
2010
ENTCS
2008
13 years 5 months ago
2008
bstraction Functor for Named Sets Vincenzo Ciancia 1 Ugo Montanari 1 Department of Computer Science University of Pisa lem of dening fully abstract operational models of name pass...
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....
POPL
2010
ACM
14 years 2 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...