Partial evaluation with inference rules (Q1108781)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Partial evaluation with inference rules |
scientific article; zbMATH DE number 4068253
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partial evaluation with inference rules |
scientific article; zbMATH DE number 4068253 |
Statements
Partial evaluation with inference rules (English)
0 references
1988
0 references
Suppose we are given a program P in some language L, and a set of inference rules based on unification that define the dynamic semantics of this language L. We propose a tactic for (partially) evaluating a given predicate in a set of inference rules, therefore proposing a new executable semantics to our rules. This tactic applied to P and to the dynamic semantics of L yields classically a new set of specialized inference rules that are a compiled version of P. Our partial evaluation tactic proposes and uses some original improvements, which are applicable to the general field of partial evaluation of unification-based languages.
0 references
Prolog
0 references
logic programming
0 references
inference rules
0 references
unification
0 references
dynamic semantics
0 references
tactic
0 references
partial evaluation
0 references
