51. Prolog program transformations and meta-interpreters
- Author
-
Patrick Lebègue, Philippe Devienne, Anne Parrain, Centre de Recherche en Informatique de Lens (CRIL), Centre National de la Recherche Scientifique (CNRS)-Université d'Artois (UA), and DELORME, Fabien
- Subjects
[INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI] ,Horn clause ,Computer science ,Programming language ,02 engineering and technology ,computer.software_genre ,Partial evaluation ,[INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI] ,Prolog ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,Semantic equivalence ,020204 information systems ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Compiler ,Equivalence (formal languages) ,computer ,Interpreter ,Logic programming ,ComputingMilieux_MISCELLANEOUS ,computer.programming_language - Abstract
Partial Evaluation in Prolog (generally associated to Folding/Unfolding techniques) is a code optimization technique, which transforms a readable and structured program in a more efficient program (that is to say better adapted to the interpreter or compiler). These programs are Prolog programs semantically equivalent with respect to the least Herbrand model. Our context is the operational equivalence of programs, and not the efficiency of program transformations.
- Published
- 1991