1302 search results - page 147 / 261 » Free-Style Theorem Proving |
137
click to vote
TYPES
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Proof erasure plays an essential role in the paradigm of programming with theorem proving. In this paper, we introduce a form of attributive types that carry an attribute...
123
click to vote
EPEW
2005
Springer
15 years 10 months ago
2005
Springer
webπ is a recent process calculus introduced to formally specify Web Services composition. It extends the π-calculus with timed workunits, namely an asynchronous and temporized m...
150
click to vote
LPAR
2005
Springer
15 years 10 months ago
2005
Springer
We investigate some syntactic properties of Wadler’s dual calculus, a term calculus which corresponds to classical sequent logic in the same way that Parigot’s λµ calculus co...
145
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. It is well known that one-dimensional cellular automata working on the usual neighborhood are Turing complete, and many acceleration theorems are known. However very litt...
146
click to vote
TLCA
2005
Springer
15 years 10 months ago
2005
Springer
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...