Reform Prolog Project Home Page

(reproduced from Financial Times without permission)

The Reform Prolog project was finished in 1996. Its successor is the High Performance Erlang project.
People count projects you finish, not the ones you start

(David Patterson)

A beta release of Reform Prolog is freely available under the GNU GPL .

The system includes a byte code emulator, a compiler with a global analyzer and documentation. The parallel system runs under Sun, Sequent Symmetry and KSR1 multiprocessors. Reform Prolog can also be used as a sequential Prolog implementation for other systems. This release is intended for interested hackers and will be superceded by a proper release in a while.

The following addresses may be of interest.

reform-request@csd.uu.se to join the reform list.
reform-bug@csd.uu.se to report bugs.
reform@csd.uu.se for discussions.

An introduction to Reform Prolog

Brief project overview

Parallel Prolog systems

People

The Reform Prolog project leader is Håkan Millroth. The other members are Johan Bevemyr, Thomas Lindgren and Magnus Nordin .

Departed: Patric Hedlin .

Papers

1996

Johan Bevemyr, A scheme for executing nested recursion-parallelism, in Proc. JICSLP'96 Workshop on Parallelism and Implementation Technologies for (Constraint) Logic Programming Languages. September, 1996.
Thomas Lindgren, Compiling for nested recursion-parallelism, in Proc. JICSLP'96 Workshop on Parallelism and Implementation Technologies for (Constraint) Logic Programming Languages. September, 1996.
Thomas Lindgren, Polyvariant detection of uninitialized arguments of Prolog predicates, January 1996. To appear, Journal of Logic Programming.

1995

Johan Bevemyr, Generational Parallel Copying Garbage Collection for Shared Memory Prolog , in ILPS Workshop on Parallel Logic Programming. Technical report 117, October 1995.
Thomas Lindgren, Per Mildner, Johan Bevemyr, On Taylor's scheme for unbound variables. Technical report 116, October 1995.
Thomas Lindgren, Control flow analysis of Prolog, August 1995. A shorter version of this paper to appear in International Logic Programming Symposium, December 1995.
Magnus Nordin, Thomas Lindgren, Håkan Millroth, IGOR: A Tool for Developing Prolog Dataflow Analyzers, July 1995. A system description to appear in International Symposium on Static Analysis, September 1995.
Thomas Lindgren, Johan Bevemyr, Håkan Millroth, Compiler Optimizations in Reform Prolog: Experiments on the KSR-1 Multiprocessor, in Proc. EUROPAR-95, LNCS 966, Springer Verlag, 1995.

1994

Håkan Millroth, SLDR-Resolution: Parallelizing Structural Recursion in Logic Programs . To appear in Journal of Logic Programming.
Thomas Lindgren A Continuation-Passing Style for Prolog . In International Logic Programming Symposium 1994.
Johan Bevemyr, Thomas Lindgren A Simple and Efficient Copying Garbage Collector for Prolog , appears in Programming Language Implementation and Logic Programming 1994, Lecture Notes in Computer Science 844.

1993 and earlier

Johan Bevemyr, Thomas Lindgren, Håkan Millroth, Reform Prolog: The Language and its Implementation. Also in Proc. 10th Int'l Conference on Logic Programming, MIT Press 1993.
Johan Bevemyr, Thomas Lindgren, Håkan Millroth, Exploiting Recursion-Parallelism in Prolog. Also in Proceedings of PARLE'93, Lecture Notes in Computer Science 694.
Håkan Millroth, Reform Compilation for Nonlinear Recursion. Also in Proc. 1992 Int'l Conference on Logic Programming and Automated Reasoning, Lecture Notes in Computer Science.
Håkan Millroth, Using the Reform Inference System for Parallel Prolog. Also in Parallelization in Inference Systems, eds. B. Fronhofer, G. Wrightson, Lecture Notes in Computer Science 590.
Håkan Millroth, Reforming Compilation of Logic Programs. Also in Proc. 1991 Int'l Logic Programming Symposium, San Diego CA.

Theses

Håkan Millroth, Reforming Compilation of Logic Programs, Uppsala Theses in Computer Science 10/90.
Johan Bevemyr, A Recursion Parallel Prolog Engine . Uppsala Theses in Computer Science 16/93.
Thomas Lindgren, The Compilation and Execution of Recursion-Parallel Prolog on Shared Memory Multiprocessors . Uppsala Theses in Computer Science 18/93.
Magnus Nordin, IGOR: A tool for developing abstract domains for Prolog analyzers, thesis for the degree of licentiate of philosophy (23/95), September, 1995.
Johan Bevemyr, Data-parallel implementation of Prolog. PhD Thesis, Uppsala Theses in Computer Science 25, November 1996.
Thomas Lindgren, Compilation techniques for Prolog, Ph.D. Thesis, Uppsala Theses in Computer Science 26, December 1996.