Sciweavers

10 search results - page 1 / 2
» Program Specialisation and Abstract Interpretation Reconcile...
Sort
View
ICLP
1998
Springer
13 years 9 months ago
Program Specialisation and Abstract Interpretation Reconciled
Interpretation Reconciled Michael Leuschel1 Department of Computer Science, K.U. Leuven, Belgium DIKU, University of Copenhagen, Denmark fy the relationship between abstract inter...
Michael Leuschel
PEPM
1993
ACM
13 years 9 months ago
Tutorial on Specialisation of Logic Programs
In this tutorial the specialisation of declarative logic programs is presented. The main correctness results are given, and the outline of a basic algorithm for partial evaluation...
John P. Gallagher
SLP
1993
110views more  SLP 1993»
13 years 6 months ago
Logic Program Specialisation With Deletion of Useless Clauses
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
D. Andre de Waal, John P. Gallagher
LOPSTR
2004
Springer
13 years 10 months ago
Fully Automatic Binding-Time Analysis for Prolog
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 ...
Stephen-John Craig, John P. Gallagher, Michael Leu...
PLILP
1993
Springer
13 years 9 months ago
Higher-Order Chaotic Iteration Sequences
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
Mads Rosendahl