186
click to vote
CSL
15 years 11 months ago
2005 Springer 
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
158
click to vote
CSL
15 years 11 months ago
2005 Springer 
We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines...
163
click to vote
CSL
15 years 11 months ago
2005 Springer 
In previous work we presented a foundational calculus for spatially distributed computing based on intuitionistic modal logic. With the modalities P and Q we were able to capture t...
137
click to vote
CSL
15 years 11 months ago
2005 Springer 
We consider the setting of L-nets, recently introduced by Faggian and Maurel as a game model of concurrent interaction and based on Girard’s Ludics. We show how L-nets satisfying...
157
click to vote
CSL
15 years 11 months ago
2005 Springer 
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
|
Automated Reasoning