91 search results - page 3 / 19 » Nominal Inversion Principles |
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...
ENTCS
2007
13 years 5 months ago
2007
d Abstract) Brian Aydemir Aaron Bohannon Stephanie Weirich Department of Computer and Information Science University of Pennsylvania Philadelphia, PA, USA We explore an axiomatize...
ICALP
2001
Springer
13 years 10 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)....
COLING
1996
13 years 6 months ago
1996
A domain independent model is proposed for the automated interpretation of nominal compounds in English. This model is meant to account for productive rules of interpretation whic...
CADE
2005
Springer
14 years 5 months ago
2005
Springer
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...