152 search results - page 8 / 31 » A Self-Applicable Partial Evaluator for Term Rewriting Syste... |
FLOPS
2004
Springer
14 years 5 days ago
2004
Springer
This paper presents a self-applicable partial evaluator for a considerable subset of full Prolog. The partial evaluator is shown to achieve non-trivial specialisation and be effect...
TACS
1994
Springer
14 years 15 days ago
1994
Springer
In the A-calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations o...
KBSE
1997
IEEE
14 years 19 days ago
1997
IEEE
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
Algorithmic skeletons can be used to write architecture independent programs, shielding application developers from the details of a parallel implementation. In this paper, we pre...
KI
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. In this paper we present a comparison of several inductive programming (IP) systems. IP addresses the problem of learning (recursive) programs from incomplete specificati...