159 search results - page 2 / 32 » Semantics of Termination |
91
Voted
ESOP
2001
Springer
15 years 4 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 ...
113
click to vote
TPHOL
2009
IEEE
15 years 6 months 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
14 years 11 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...
89
Voted
CSL
2008
Springer
15 years 1 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...