Sciweavers

3658 search results - page 98 / 732
» The logic of proofs, semantically
Sort
View
ENTCS
2006
171views more  ENTCS 2006»
15 years 6 months ago
Program Extraction From Proofs of Weak Head Normalization
We formalize two proofs of weak head normalization for the simply typed lambdacalculus in first-order minimal logic: one for normal-order reduction, and one for applicative-order ...
Malgorzata Biernacka, Olivier Danvy, Kristian St&o...
CORR
2010
Springer
151views Education» more  CORR 2010»
15 years 6 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur
AMAI
2007
Springer
15 years 6 months ago
Partial equilibrium logic
Abstract. Partial equilibrium logic (PEL) is a new nonmonotonic reasoning formalism closely aligned with logic programming under well-founded and partial stable model semantics. In...
Pedro Cabalar, Sergei P. Odintsov, David Pearce, A...
VMCAI
2009
Springer
16 years 1 months ago
Towards Automatic Stability Analysis for Rely-Guarantee Proofs
The Rely-Guarantee approach is a well-known compositional method for proving Hoare logic properties of concurrent programs. In this approach, predicates in the proof must be proved...
Hasan Amjad, Richard Bornat
TCS
2002
15 years 6 months ago
Logical systems for structured specifications
We study proof systems for reasoning about logical consequences and refinement of structured specifications, based on similar systems proposed earlier in the literature [ST 88, Wi...
Tomasz Borzyszkowski