77 search results - page 8 / 16 » Partiality and Nondeterminacy in Program Proofs |
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
We present a pair of reasoning principles, definition and proof by rigid induction, which can be seen as proper generalizations of lazy-datatype induction to monadic effects other...
TPHOL
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract. We present a comprehensive set of tactics that make it practical to use separation logic in a proof assistant. These tactics enable the verification of partial correctne...
LICS
1989
IEEE
13 years 10 months ago
1989
IEEE
We describe Elf, a metalanguage for proof manipulation environments that are independent of any particular logical system. Elf is intended for meta-programs such as theorem prover...
LICS
1991
IEEE
13 years 11 months ago
1991
IEEE
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
IANDC
2008
13 years 7 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...