Mixed computation of Prolog programs

DOI10.1007/BF03037134zbMath0654.68021OpenAlexW1978509573WikidataQ57006952 ScholiaQ57006952MaRDI QIDQ1108777

David A. Fuller, Samson Abramsky

Publication date: 1988

Published in: New Generation Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03037134

zbMATH Keywords

correctnesspartial evaluationPrologcompiler generationmixed computationself application

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Mixed computation of Prolog programs ⋮ Mixed computation and compilation: New approaches to old problems ⋮ How to control unfolding when specializing interpreters ⋮ A partial evaluator for the untyped lambda-calculus

Uses Software

• Refal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mixed computation of Prolog programs
• Mixed computation: potential applications and problems for study
• A partial evaluator, and its use as a programming tool
• Logic programming and compiler writing

This page was built for publication: Mixed computation of Prolog programs