2623 search results - page 410 / 525 » Hoare Logic in the Abstract |
KR
2010
Springer
15 years 2 months ago
2010
Springer
We consider positive rules in which the conclusion may contain existentially quantified variables, which makes reasoning tasks (such as Deduction) undecidable. These rules have t...
ICFP
2000
ACM
15 years 2 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
ECOOP
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. Automatic program specialization can derive efficient implementations from generic components, thus reconciling the often opposing goals of genericity and efficiency. Thi...
TPHOL
1999
IEEE
15 years 2 months ago
1999
IEEE
Abstract. We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interact...
TYPES
1993
Springer
15 years 1 months ago
1993
Springer
Abstract. We explore the expressive power of the formalism called Natural Operational Semantics, NOS, introduced by Burstall and Honsell for defining the operational semantics of ...