9 search results - page 1 / 2 » Higher-order representation predicates in separation logic |
185
Voted
ICML
1989
IEEE
15 years 10 months ago
1989
IEEE
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...
166
Voted
ENTCS
2008
15 years 6 months ago
2008
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...
182
Voted
POPL
2010
ACM
16 years 3 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
158
Voted
TPHOL
2007
IEEE
16 years 19 days 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...
169
Voted
TOCL
2008
15 years 6 months ago
2008
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...