5964 search results - page 228 / 1193 » A theory of speculative computation |
157
click to vote
SYNASC
2006
IEEE
16 years 1 months ago
2006
IEEE
In this paper, we report a case study of computer supported exploration of the theory of natural numbers, using a theory exploration model based on knowledge schemes, proposed by ...
176
click to vote
CONCUR
2006
Springer
15 years 11 months ago
2006
Springer
This paper studies the (in)equational theory of simulation preorder and equivalence over the process algebra BCCSP. We prove that in the presence of a finite alphabet with at least...
253
click to vote
CONCUR
2008
Springer
15 years 9 months ago
2008
Springer
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
194
click to vote
AAAI
1994
15 years 8 months ago
1994
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...
183
click to vote
ESOP
2009
Springer
15 years 11 months ago
2009
Springer
We present an algebraic treatment of exception handlers and, more generally, introduce handlers for other computational effects representable by an algebraic theory. These include ...