𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A residualizing semantics for the partial evaluation of functional logic programs

✍ Scribed by Elvira Albert; Michael Hanus; Germán Vidal

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
103 KB
Volume
85
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

✦ Synopsis

Recent proposals for multi-paradigm declarative programming combine the most important features of functional, logic and concurrent programming into a single framework. The operational semantics of these languages is usually based on a combination of narrowing and residuation. In this paper, we introduce a non-standard, residualizing semantics for multiparadigm declarative programs and prove its equivalence with a standard operational semantics. Our residualizing semantics is particularly relevant within the area of program transformation where it is useful, e.g., to perform computations during partial evaluation. Thus, the proof of equivalence is a crucial result to demonstrate the correctness of (existing) partial evaluation schemes.

📜 SIMILAR VOLUMES

On the equivalence of semantics for norm
On the equivalence of semantics for normal logic programs
✍ Jia-Huai You; Li Yan Yuan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 699 KB

Despite the frequent comment that there is no general agreement on the semantics of logic programs, this paper shows that a number of independently proposed extensions to the stable model semantics coincide: the regular model semantics proposed by You and Yuan, the partial stable model semantics by

A note on the stable model semantics for
A note on the stable model semantics for logic programs
✍ Michael Kaminski 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 900 KB

The stable model semantics for logic programs is extended from ground literals onto open literals by augmenting the program language with an infinite set of new constants. This, in turn, leads to a natural translation of logic programs into open default theories. @

A semantic basis for the termination ana
A semantic basis for the termination analysis of logic programs
✍ Michael Codish; Cohavit Taboch 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 287 KB

This paper presents a formal semantic basis for the termination analysis of logic programs. The semantics exhibits the termination properties of a logic program through its binary unfoldings ± a possibly in®nite set of binary clauses. Termination of a program P and goal G is determined by the absenc