An Early Use of Continuations and Partial Evaluation for Compiling Rules Written in First-Order Predicate Calculus

Authors:
Erik Sandewall
Affiliations:
Department of Computer and Information Science, Linköping University, SE-58183 Linköping, Sweden. erisa@ida.liu.se
Venue:
Higher-Order and Symbolic Computation
Year:
1999

Citing 4
Cited 2

The discoveries of continuations

Lisp and Symbolic Computation - Special issue on continuations—part I
Partial evaluation as a means for inferencing data structures in an applicative language: a theory and implementation in the case of prolog

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Definitional interpreters for higher-order programming languages

ACM '72 Proceedings of the ACM annual conference - Volume 2
A proposed solution to the FUNARG problem

ACM SIGSAM Bulletin

On the static and dynamic extents of delimited continuations

Science of Computer Programming
A syntactic correspondence between context-sensitive calculi and abstract machines

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This brief historical note describes research done in the period 1970-1973, and where continuations were introduced in a fairly pragmatic way together with partial evaluation in order to compile “rules” expressed as statements in first-order predicate calculus. Although the methods used at that time were quite straightforward, this work may shed some light onthe early history of the concept of continuations. In particular,unlike other early contributions that addressed issues inmainstream programming languages, the present approach initiallyaddressed implementation techniques for special-purpose languages.