Sciweavers

143 search results - page 26 / 29
» Termination of Well-Typed Logic Programs
Sort
View
AGP
1994
IEEE
13 years 11 months ago
What the Event Calculus actually does, and how to do it efficiently
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
DBPL
1999
Springer
114views Database» more  DBPL 1999»
13 years 11 months ago
Structured Document Transformations Based on XSL
Abstract. Based on the recursion mechanism of the XML transformation language XSL, the document transformation language DTL is defined. First the instantiation DTLreg is considere...
Sebastian Maneth, Frank Neven
DAGSTUHL
1996
13 years 8 months ago
Global Control for Partial Deduction through Characteristic Atoms and Global Trees
Recently, considerable advances have been made in the (on-line) control of logic program specialisation. A clear conceptual distinction has been established between local and glob...
Michael Leuschel, Bern Martens
PPDP
2005
Springer
14 years 26 days ago
Self-tuning resource aware specialisation for prolog
The paper develops a self-tuning resource aware partial evaluation technique for Prolog programs, which derives its own control strategies tuned for the underlying computer archit...
Stephen-John Craig, Michael Leuschel
ECOOP
2006
Springer
13 years 11 months ago
codeQuest:  Scalable Source Code Queries with Datalog
Abstract. Source code querying tools allow programmers to explore relations between different parts of the code base. This paper describes such a tool, named CodeQuest. It combines...
Elnar Hajiyev, Mathieu Verbaere, Oege de Moor