Sciweavers

42 search results - page 3 / 9
» Normal Form Theorem Proving for the Lambek Calculus
Sort
View
TPHOL
2007
IEEE
13 years 11 months ago
Source-Level Proof Reconstruction for Interactive Theorem Proving
Abstract. Interactive proof assistants should verify the proofs they receive from automatic theorem provers. Normally this proof reconstruction takes place internally, forming part...
Lawrence C. Paulson, Kong Woei Susanto
TLCA
1993
Springer
13 years 9 months ago
The Conservation Theorem revisited
This paper describes a method of proving strong normalization based on an extension of the conservation theorem. We introduce a structural notion of reduction that we call βS, and...
Philippe de Groote
LPAR
2012
Springer
12 years 26 days ago
The TPTP Typed First-Order Form with Arithmetic
Abstract. The TPTP World is a well established infrastructure supporting research, development, and deployment of Automated Theorem Proving systems. Recently, the TPTP World has be...
Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Pe...
ICALP
2004
Springer
13 years 10 months ago
A Calculus of Coroutines
We describe a simple but expressive calculus of sequential processes, represented as coroutines. We show that this calculus can be used to express a variety of programming languag...
James Laird
IGPL
2011
12 years 8 months ago
Interpolation and FEP for logics of residuated algebras
A residuated algebra (RA) is a generalization of a residuated groupoid; instead of one basic binary operation · with residual operations \, /, it admits finitely many basic oper...
Wojciech Buszkowski