9 search results - page 1 / 2 » Proof Pearl: Using Combinators to Manipulate let-Expressions... |
TPHOL
2005
IEEE
13 years 10 months ago
2005
IEEE
We discuss methods for dealing effectively with let-bindings in proofs. Our contribution is a small set of unconditional rewrite rules, found by the bracket abstraction translatio...
CAV
2012
Springer
11 years 7 months ago
2012
Springer
Craig interpolation is a well known method of abstraction successfully used in both hardware and software model checking. The logical strength of interpolants can affect the quali...
RAS
2010
13 years 3 months ago
2010
This article investigates fundamental issues in scaling autonomous personal robots towards open-ended sets of everyday manipulation tasks which involve high complexity and vague j...
ENTCS
2008
13 years 5 months ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
POPL
2008
ACM
14 years 5 months ago
2008
ACM
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...