11 search results - page 2 / 3 » Explicit substitutions and higher-order syntax |
ICFP
2005
ACM
14 years 4 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
FOSSACS
2003
Springer
13 years 10 months ago
2003
Springer
rized Verification by Probabilistic Abstraction . . . . . . . . . . . . . . . . 87 Tamarah Arons, Amir Pnueli, Lenore Zuck Genericity and the π-Calculus . . . . . . . . . . . . ....
LOGCOM
2008
13 years 4 months ago
2008
The practice of first-order logic is replete with meta-level concepts. Most notably there are meta-variables ranging over formulae, variables, and terms, and properties of syntax s...
TPHOL
2002
IEEE
13 years 9 months ago
2002
IEEE
g Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 ...
ICFP
2000
ACM
13 years 9 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...