217 search results - page 7 / 44 » Automatic Termination |
ICLP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
SAS
2005
Springer
14 years 2 months ago
2005
Springer
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
FROCOS
2011
Springer
12 years 8 months ago
2011
Springer
Many functional programs and higher order term rewrite systems contain, besides higher order rules, also a significant first order part. We discuss how an automatic termination p...
LOPSTR
2004
Springer
14 years 1 months ago
2004
Springer
Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have ...
CAV
2006
Springer
14 years 9 days ago
2006
Springer
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...