198 search results - page 1 / 40 » A New Approach to Abstract Syntax Involving Binders |
LICS
1999
IEEE
13 years 9 months ago
1999
IEEE
ICFP
2010
ACM
13 years 5 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...
JCSS
2010
13 years 3 months ago
2010
Nominal techniques were introduced to represent in a simple and natural way that involve binders. The syntax includes an abstraction operator and a primitive notion of name swappin...
BIRTHDAY
2010
Springer
13 years 4 months ago
2010
Springer
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
TPHOL
2005
IEEE
13 years 10 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...