Logic enhancement: A method for extending logic programming languages

Authors:
Paul R Eggert;D Val Schorre
Affiliations:
-;-
Venue:
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Year:
1982

Citing 9
Cited 2

Programming in Prolog (2nd ed.)

Programming in Prolog (2nd ed.)
Logic for problem-solving

Logic for problem-solving
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Verifying Security

ACM Computing Surveys (CSUR)
Programming with Equations

ACM Transactions on Programming Languages and Systems (TOPLAS)
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Functional Programming

Functional Programming
Computing in Systems Described by Equations

Computing in Systems Described by Equations
The prolog phenomenon

ACM SIGART Bulletin

Making control and data flow in logic programs explicit

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Building libraries in Prolog

IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Languages based on first order logic have rapidly gained popularity as practical programming languages in several fields. With experience, several problems with the most popular such language, Prolog, have come to light. Several proposals for changes and extensions to Prolog have been made, but proposals have been expensive to build and evaluate. An inexpensive method for extension is described that relies on preprocessors and checkers written in Prolog itself. The method is efficient and applies to any logic programming language that permits manipulation of programs as objects. Several extensions have been built, including modules, macros, functional notation, repetition notation, debugging, and profiling; the first three are explored in detail.