159 search results - page 2 / 32 » Semantics of Termination |
ESOP
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...
WFLP
2009
Springer
14 years 10 days ago
2009
Springer
TPHOL
2009
IEEE
14 years 12 days ago
2009
IEEE
We present four coinductive operational semantics for the While language accounting for both terminating and non-terminating program runs: big-step and small-step relational semant...
PPL
2007
13 years 5 months ago
2007
In this paper, we present an program that enables the transformation of a nonterminating alternator into a terminating alternator. Our solution is stabilization preserving and has...
CSL
2008
Springer
13 years 7 months ago
2008
Springer
Type-based termination is a semantically intuitive method that ensures termination of recursive definitions by tracking the size of datatype elements, and by checking that recursiv...