1410 search results - page 129 / 282 » Proving theorems by reuse |
126
click to vote
KI
2007
Springer
16 years 3 days ago
2007
Springer
With this talk we want to pay tribute to the late Professor Gerd Veenker who deserves the historic credit of initiating the formation of the German AI community. We present a summa...
158
click to vote
TYPES
2007
Springer
16 years 2 days 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...
141
click to vote
EPEW
2005
Springer
15 years 11 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...
168
click to vote
LPAR
2005
Springer
15 years 11 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...
167
click to vote
STACS
2005
Springer
15 years 11 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...