1147 search results - page 94 / 230 » Termination in language-based systems |
CSL
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. In this paper we show how to extend a constructive type theory with a principle that captures the spirit of Markov’s principle from constructive recursive mathematics. ...
CL
2000
Springer
15 years 2 months ago
2000
Springer
In this paper, an algorithm for obtaining consistent answers to queries posed to inconsistent relational databases is presented. The algorith is proven to be sound, terminating and...
ERSHOV
1999
Springer
15 years 2 months ago
1999
Springer
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that h...
APLAS
2007
ACM
15 years 1 months ago
2007
ACM
Abstract. We introduce the concept of guarded saturated sets, saturated sets of strongly normalizing terms closed under folding of corecursive functions. Using this tool, we can mo...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the ed...