88 search results - page 5 / 18 » Nominal Reasoning Techniques in Coq: (Extended Abstract) |
TPHOL
2007
IEEE
15 years 3 months ago
2007
IEEE
Placing our result in a web of related mechanised results, we give a direct proof that the de Bruijn λ-calculus (`a la Huet, Nipkow and Shankar) is isomorphic to an α-quotiented ...
ESOP
2012
Springer
13 years 5 months ago
2012
Springer
Abstract. This paper presents GMeta: a generic framework for firstorder representations of variable binding that provides once and for all many of the so-called infrastructure lem...
POPL
2010
ACM
15 years 6 months ago
2010
ACM
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
BIRTHDAY
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence...
DLOG
2001
14 years 10 months ago
2001
In this extended abstract an optimization technique, the so-called signature calculus, for reasoning with number restrictions in description logics is investigated. The calculus i...