Mixed computation of Prolog programs
type: Item
instance of: scholarly article
title: Mixed computation of Prolog programs
zbMATH Open document ID: 0654.68021
DOI: 10.1007/BF03037134
author: David A. Fuller
author: Samson Abramsky
published in: New Generation Computing
publication date: 1988-01-01T00:00:00Z
review text: This paper describes theoretical as well as implementation issues involed in the design of a mix partial evaluator, starting from an interpretive specification using Prolog as the source language. First, the general theory of mixed computation is shown, together with the description of some of the problems involved in it. After this, the design of a mix partial evaluator for a subset of Prolog is explained. Here, three algorithms with increasing complexity are shown. Finally, a correctness criterion for the mix process is presented, together with the proof that the previously shown algorithms generate correct residual programs.
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68N20
zbMATH DE Number: 4068251
zbMATH Keywords: partial evaluation
zbMATH Keywords: self application
zbMATH Keywords: compiler generation
zbMATH Keywords: Prolog
zbMATH Keywords: mixed computation
zbMATH Keywords: correctness
Wikidata QID: Q57006952
describes a project that uses: Refal
MaRDI profile type: Publication
cites work: Q3664434
cites work: A partial evaluator, and its use as a programming tool
cites work: Q4134896
cites work: Q4151136
cites work: Mixed computation: potential applications and problems for study
cites work: Q4051550
cites work: Q3339245
cites work: Q3711735
cites work: Q3742690
cites work: Logic programming and compiler writing
full work available at URL: https://doi.org/10.1007/bf03037134
OpenAlex ID: W1978509573
description: scientific article; zbMATH DE number 4068251