233 search results - page 38 / 47 » Computational Lambda-Calculus and Monads |
NJC
2006
13 years 7 months ago
2006
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
CONCUR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We introduce a novel way to integrate functional and concurrent programming based on intuitionistic linear logic. The functional core arises from interpreting proof reduc...
POS
1994
Springer
13 years 11 months ago
1994
Springer
Persistent stores support uniform management of data objects regardless of their lifetimes and locations. Such stores typically maintain a self-consistent state even after failure...
JAPLL
2010
13 years 6 months ago
2010
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule...