8 search results - page 1 / 2 » Free Variables and Subexpressions in Higher-Order Meta Logic |
TPHOL
1998
IEEE
13 years 9 months ago
1998
IEEE
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Nominal Logic is an extension of first-order logic with equality, name-binding, name-swapping, and freshness of names. Contrarily to higher-order logic, bound variables a...
AGP
1999
IEEE
13 years 9 months ago
1999
IEEE
We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in ...
TPHOL
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract. In this proof pearl, we demonstrate the power of higherorder encodings in the logical framework Twelf[PS99] by investigating proofs about an algorithmic specification of...
LPAR
2012
Springer
12 years 24 days ago
2012
Springer
E-matching is the most commonly used technique to handle quantifiers in SMT solvers. It works by identifying characteristic subexpressions of quantified formulae, named triggers,...