700 search results - page 46 / 140 » On Termination of Constraint Logic Programs |
CADE
2009
Springer
15 years 12 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
CADE
2006
Springer
15 years 11 months ago
2006
Springer
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
174
click to vote
CADE
2011
Springer
13 years 11 months ago
2011
Springer
Android is a programming language based on Java and an operating system for embedded or mobile devices whose upper layers are written in that language. It features an extended even...
CORR
2004
Springer
14 years 11 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
126
click to vote
ICLP
2011
Springer
14 years 2 months ago
2011
Springer
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...