Uppsala Computing Science Department Technical Reports
* * * THIS FILE IS OUT OF DATE * * *
Reports that are not available electronically can be ordered from our
librarian.
- Kenneth M. Kahn, INTERMISSION---Actors in Prolog, October
1981.
(Report 1)
- Kenneth M. Kahn, UNIFORM---A Language Based upon Unification which Unifies (much
of) LISP, Prolog and Act 1, October 1981.
(Report 2)
- Agneta Eriksson and Anna-Lena
Johansson, NATDED---A Derivation Editor, October 1981.
(Report 3)
- Göran Hagert and
Sten-Åke Tärnlund, Deductive Modeling of Human Cognition, November 1981.
(Report 4)
- Mats
Carlsson, (Re)Implementing Prolog in LISP or YAQ -- Yet Another QLOG, November 1981.
(Report 5)
- Mats
Carlsson, On Implementing Prolog in Functional Programming, December 1983.
(Report 5B)
- Sten-Åke Tärnlund, A Programming Language Based on a Natural Deduction
System, November 1981.
(Report 6)
- Åke Hansson and
Sten-Åke Tärnlund, Program Transformation by Data Structure Mapping, November 1981.
(Report 7)
- Åke Hansson and Seif
Haridi and Sten-Åke Tärnlund, Properties of a Logic Programming Language, November 1981.
(Report 8)
- Kenneth M. Kahn, The Implementation of Uniform---A
Knowledge-Representation/Programming Language Based upon Equivalence of
Descriptions, March 1982.
(Report 9)
- Stellan
Ohlsson, On the Automated Learning of Problem Solving Rules, July 1982.
(Report 10)
- Agneta Eriksson and Anna-Lena Johansson
and Sten-Åke Tärnlund, Towards a Derivation Editor, revised November 1983.
(Report 11B)
- Agneta Eriksson and
Anna-Lena Johansson, Computer-Based Synthesis of Logic Programs, August 1982.
(Report 12)
- Stellan Ohlsson, Transfer of Training in Procedural Learning: A Matter of
Conjectures and Refutations?, September 1982.
(Report 13)
- Kenneth M. Kahn, A Grammar Kit in Prolog, revised
by Mats Carlsson, February 1985.
(Report 14C)
- Kenneth M. Kahn, Unique Features of LISP Machine Prolog, revised
by Mats Carlsson, February 1985.
(Report 15B)
- Kenneth
M. Kahn, A Primitive for the Control of Logic Programs, February 1983.
(Report 16)
- Kenneth
M. Kahn, A Partial Evaluator of LISP Written in Prolog, February 1983.
(Report 17)
- Anneli Edman
and Sten-Åke Tärnlund, Mechanization of an Oracle in a Debugging System, April 1983.
(Report 18)
- Martin Nilsson, A Logical Model of Knowledge, June 1983.
(Report 19)
- Martin
Nilsson, FOOLOG---A Small and Efficient Prolog Interpreter, June 1983.
(Report 20)
- Göran Hagert and Åke
Hansson, Logic Modelling of Cognitive Reasoning, July 1983.
(Report 21)
- Lars-Henrik Eriksson, Synthesis of a Unification Algorithm in a Logic Programming
Calculus, revised February 1984.
(Report 22B)
- Kenneth M. Kahn, Partial Evaluation as an Example of the Relationships between
Programming Methodology and Artificial Intelligence, October
1983.
(Report 23)
- Mats Carlsson and Kenneth M. Kahn, LM-Prolog User Manual, November
1983, revised April 1985.
(Report 24)
- Göran Hagert and
Åke Hansson, Reasoning Models within a Logical Framework, April 1984.
(Report 25)
- Martin
Nilsson, Declarative Determinism in Prolog Implementations, August 1984.
(Report 26)
- Kenneth M. Kahn and Mats Carlsson, The Compilation of Prolog Programs without the Use of a Prolog
Compiler, August 1984.
(Report 27)
- Martin
Nilsson, Prolog as a Tool for Optimizing Prolog Unifiers, August 1984.
(Report 28)
- Martin Nilsson, A Logical Model of Knowledge and Belief, October
1984.
(Report 29)
- Mats
Carlsson, LM-Prolog---the language and its implementation, October 1984.
(Report 30)
- Lennart Beckman, Semantics for a Computational Model for Parallel Execution of Logic
Programs, October 1985.
(Report 31; out of print).
- Agneta Eriksson and Anna-Lena
Johansson, Neat Explanation of Proof Trees, October 1985.
(Report 32)
- Anna-Lena
Johansson, Using Symmetry and Substitution in Program Derivation,
December 1985. (Report 33)
- Sten-Åke
Tärnlund, Logic Programming---from a Logic Point of View, September 1986.
(Report 34)
- Mats
Carlsson, Compilation for Tricia and its Abstract Machine, September 1986.
(Report 35)
- Jonas Barklund, A Garbage Collection Algorithm for Tricia, December
1987.
(Report 37B)
- Jonas Barklund and Håkan Millroth, Garbage Cut, October
1986.
(Report 38)
- Jonas
Barklund, Efficient Interpretation of Prolog Programs, April 1987.
(Report 39)
- Jonas Barklund and
Håkan Millroth, Hash Tables in Logic Programming, April 1987.
(Report 40)
- Sven-Olof
Nyström, Guarded Horn Clauses, Application and Implementation, November 1987.
(Report 41)
- Jonas Barklund and
Håkan Millroth, Integrating Complex Data Structures in Prolog, October 1987.
(Report 42)
- Sven-Olof
Nyström, An Abstract Machine for Guarded Horn Clauses, December 1987.
(Report 43)
- Mats
Nylén, List and Tree Matching on Fine-grained Parallel SIMD Computers, May 1988.
(Report 44)
- Anna-Lena Johansson, Simplifying Program Derivation by Using Program Schemas:
a Study of Transitive Closures, April 1988.
(Report 45)
- Jonas Barklund and Håkan
Millroth, A Parallel Unification Algorithm, April 1989.
(Report 46)
- Jonas Barklund and Nils Hagner and Malik Wafin, Condition Graphs, June
1988.
(Report 48)
- Sven-Olof Nyström, Introducing Abstract Data Types with Inheritance into
Prolog, June 1988.
(Report 49)
- Jonas Barklund, What Is a Meta-variable in Prolog?, May 1988.
(Report 50)
- Jonas Barklund and
Nils Hagner and Malik Wafin, KL1 in Condition Graphs on a Connection Machine, May 1988.
(Report 51)
- Jonas Barklund and Håkan Millroth, Nova Prolog, July 1988.
(Report 52)
- Peter Pavek, PICON and the Paper Industry, May 1987.
(Report 53)
- Anders Hjort and Peter Pavek, Pulp Expert, July 1988.
(Report 54)
- Andreas Hamfelt and Jonas Barklund, Metalevels in Legal Knowledge and their Runnable Representation in
Logic, June 1989.
(Report 55)
- Torkel
Hjerpe and Fredrik Möllerberg and Kent Andersson, Making Minimal Plans---Knowledge Based Plan Execution, September 1989.
(Report 56)
- Björn Carlson and
Fredrik Kant and Jan Wünsche, A Scheme for Functions in Logic Programming, December 1989.
(Report 57)
- Johan Montelius, Improvements to an OR-parallel Execution Model for
Logic Programs, December 1989.
(Report 58)
- Keith L.
Clark, Logic Programming Schemes and their Implementations, March 1990.
(Report 59)
- Andreas Hamfelt and Jonas Barklund, An Intelligent Interface to Legal Data Bases Combining Logic Programming and
Hypertext, December 1989.
(Report 60)
- Jonas Barklund
and Andreas Hamfelt, Metaprogramming for Representation of Legal Principles, July 1990.
(Report 61)
- Monika Danielsson and Jonas Barklund, Persistent Data Storage for Prolog, July
1990.
(Report 62)
- Keith L. Clark, Parallel Logic Programming, September 1990.
(Report 63)
- Jonas
Barklund and Andreas Hamfelt and Jan Wünsche, A Modular Architecture for Knowledge Systems, September 1990.
(Report 64)
- Sven-Olof
Nyström, Variable-Free Execution of Concurrent Logic Languages, January 1990.
(Report 65)
- Andreas Hamfelt and Åke Hansson, Metalogic Representation of Stratified
Knowledge, April 1991.
(Report 66)
- Håkan Millroth, Reforming Compilation of Logic Programs, July 1991.
(Report 67)
- Andreas Hamfelt and Åke Hansson, Representation of Fragmentary and Multilayered Knowledge---A Semiformal
Metatheory as an Interactive Metalogic Program, December
1991.
(Report 68)
- Håkan Millroth, Using the Reform Inference System for Parallel Prolog, January
1992.
(Report 69)
- Håkan Millroth, Compiling Nonlinear Recursion to Parallel Iteration, January
1992.
(Report 70)
- Jonas Barklund and Håkan Millroth, Providing Iteration and Concurrency in Logic Programs through
Bounded Quantifications, September 1992.
(Report 71)
- Johan Bevemyr, The Luther WAM Emulator, March 1992.
(Report 72)
- Per
Mildner and Jonas Barklund, Design and Implementation of a Modular Real Time Expert System, November 1992.
(Report 73)
- Henrik Arro and Jonas Barklund
and Johan Bevemyr, Parallel Bounded Quantification---Preliminary Results, November 1992.
(Report 74)
- Johan Bevemyr and
Thomas Lindgren and Håkan Millroth, Exploiting Recursion-Parallelism in Prolog, November 1993.
(Report 75)
- Johan Bevemyr and
Thomas Lindgren and Håkan Millroth, Reform Prolog: The Language and its Implementation, November 1993.
(Report 76)
- Jonas Barklund
and Johan Bevemyr, Prolog with Arrays and Bounded Quantifications, September 1993.
(Report 77)
- Jonas
Barklund and Bharat Jayaraman and Jiro Tanaka (eds.), Parallel and Data
Parallel Execution of Logic Programs, June 1994. Proceedings.
( Report 78 )
- Sven-Olof Nyström and Bengt Jonsson, Indeterminate Concurrent Constraint Programming: A
Fixpoint Semantics for Non-Terminating Computations, July 1994.
(Report 79)
- Jonas Barklund, Metaprogramming in Logic, July 1994.
( Report 80 )
- Jonas Barklund and Katrin Boberg and Pierangelo Dell'Acqua, A Basis for a Multilevel Metalogic Programming Language, July 1994.
( Report 81 )
- Jonas
Barklund, Tabulation of Functions in Definite Clause Programs, July 1994.
( Report 82 )
- Jonas
Barklund and Stefania Costantini and Pierangelo Dell'Acqua and Gaetano
A. Lanzarone, Reflective Prolog = CLP(Names,Trees), July 1994.
(Report 83)
- Björn Carlson and Mats Carlsson and Daniel Diaz,
Entailment of Finite Domain Constraints, August 1994.
(Report 84)
- Björn Carlson and Seif Haridi and
Sverker Janson,
AKL(FD) -- A Concurrent Language for FD Programming, August 1994.
(Report 85)
- Thomas Lindgren, A Continuation-Passing Style for Prolog, August 1994.
(Report 86).
- Johan Bevemyr and Thomas Lindgren, A Simple and Efficient Copying
Garbage Collector for
Prolog, August 1994.
(Report 87)
- Andrei Voronkov,
Implementing Bottom-up Procedures with Code Trees: a Case Study of Forward
Subsumption,
October 1994.
(Report 88)
Thomas Lindgren / thomasl@csd.uu.se, lindgren@sics.se