Sciweavers

239 search results - page 7 / 48
» Partial Evaluation of Functional Logic Programs
Sort
View
PEPM
1994
ACM
13 years 11 months ago
Dictionary-Free Overloading by Partial Evaluation
One of the most novel features in the functional programming language Haskell is the system of type classes used to support a combination of overloading and polymorphism. Current ...
Mark P. Jones
ICLP
2010
Springer
13 years 11 months ago
Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions
Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with A...
Fabrizio Riguzzi, Terrance Swift
IPL
2008
102views more  IPL 2008»
13 years 7 months ago
The connection between two ways of reasoning about partial functions
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
John S. Fitzgerald, Cliff B. Jones
SLP
1993
110views more  SLP 1993»
13 years 8 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
1992
Springer
13 years 11 months ago
Logimix: A Self-Applicable Partial Evaluator for Prolog
We present a self-applicable partial evaluator for a large subset of full Prolog. The partial evaluator, called Logimix, is the result of applying our experience from partial eval...
Torben Æ. Mogensen, Anders Bondorf