Sciweavers

SLP
1993
110views more  SLP 1993»
13 years 5 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
SLP
1993
56views more  SLP 1993»
13 years 5 months ago
Deterministic Parsing of Languages with Dynamic Operators
Kjell Post, Allen Van Gelder, James Kerr
SLP
1993
91views more  SLP 1993»
13 years 5 months ago
Unification in a Lambda-Calculus with Intersection Types
Michael Kohlhase, Frank Pfenning
SLP
1993
117views more  SLP 1993»
13 years 5 months ago
Boolean Constraint Solving Using clp(FD)
We present a boolean constraint logic language clp(B/FD) built upon a language over finite domains clp(FD) which uses a local propagation constraint solver. It is based on a sing...
Philippe Codognet, Daniel Diaz
SLP
1993
86views more  SLP 1993»
13 years 5 months ago
Declarative Programming in Prolog
We try to assess to what extent declarative programming can be realized in Prolog and which aspects of correctness of Prolog programs can be dealt with by means of declarative int...
Krzysztof R. Apt
SLP
1993
45views more  SLP 1993»
13 years 5 months ago
Order-Sorted Feature Theory Unification
Hassan Aït-Kaci, Andreas Podelski, Seth Copen...