2272 search results - page 246 / 455 » A Calculus for |
118
click to vote
CIE
2006
Springer
15 years 8 months ago
2006
Springer
Wegner and Eberbach[Weg04b] have argued that there are fundamental limitations to Turing Machines as a foundation of computability and that these can be overcome by so-called super...
137
Voted
ASP
2001
Springer
15 years 8 months ago
2001
Springer
We propose a situation calculus formalization of action domains that include numeric-valued fluents (so-called additive or measure fluents) and concurrency. Our approach allows fo...
123
click to vote
FPCA
1991
15 years 8 months ago
1991
We develop a calculus for lazy functional programming based on recursion operators associated with data type de nitions. For these operators we derive various algebraic laws that ...
108
Voted
LICS
1987
IEEE
15 years 8 months ago
1987
IEEE
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed -calculus ...
133
click to vote
DALT
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We define a framework based on computational logic technology and on a reactive axiomatization of the Event Calculus to formalize the evolution of commitments in time. We...