1564 search results - page 1 / 313 » Extensions to the Estimation Calculus |
LPAR
1999
Springer
13 years 8 months ago
1999
Springer
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...
PROCOMET
1998
13 years 5 months ago
1998
A convention is proposed for embedding program statements into Dijkstra's calculus, with the aim of simplifying the stepwise construction of programs.
ECOOP
1998
Springer
13 years 8 months ago
1998
Springer
This paper presents an imperative object calculus designed to support class-based programming via a combination of extensible objects and encapsulation. This calculus simplifies th...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The Lambek-Grishin calculus LG is the symmetric extension of the non-associative Lambek calculus NL. In this paper we prove that the derivability problem for LG is NP-complete.
APAL
2006
13 years 4 months ago
2006
By a well-known result of Cook and Reckhow [4, 12], all Frege systems for the Classical Propositional Calculus (CPC) are polynomially equivalent. Mints and Kojevnikov [11] have re...