700 search results - page 10 / 140 » On Termination of Constraint Logic Programs |
EUSFLAT
2009
13 years 6 months ago
2009
ALP
1994
Springer
14 years 19 days ago
1994
Springer
This paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is de ned which given a logic program computes a TRS. For a...
FASE
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. This paper describes a specialised logic for proving specifications in the Java Modeling Language (JML). JML is an interface specification language for Java. It allows ...
PPCP
1993
14 years 18 days ago
1993
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
BIRTHDAY
2007
Springer
14 years 2 months ago
2007
Springer
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand t...