Uppsala Computing Science Department Technical Reports
* * * THIS FILE IS OUT OF DATE * * *

<TITLE> Uppsala Computing Science Department Technical Reports </TITLE>
<H1> Uppsala Computing Science Department Technical Reports 
<br> * * * THIS FILE IS OUT OF DATE * * *
</H1>

Reports that are not available electronically can be ordered from our
<!--
<a href="http://www.csd.uu.se/~thomasl/csd-address.html"> librarian </a>.
 -->
librarian.

<UL>

<LI> Kenneth M. Kahn, INTERMISSION---Actors in Prolog, October
1981. 
(Report 1)
<LI>Kenneth M. Kahn, UNIFORM---A Language Based upon Unification which Unifies (much
of) LISP, Prolog and Act 1, October 1981. 
(Report 2)
<LI> Agneta Eriksson and Anna-Lena
Johansson, NATDED---A Derivation Editor, October 1981. 
(Report 3)
<LI> G&ouml;ran Hagert and
Sten-&Aring;ke T&auml;rnlund, Deductive Modeling of Human Cognition, November 1981. 
(Report 4)
<LI> Mats
Carlsson, (Re)Implementing Prolog in LISP or YAQ -- Yet Another QLOG, November 1981. 
(Report 5)
<LI> Mats
Carlsson, On Implementing Prolog in Functional Programming, December 1983. 
(Report 5B)
<LI> Sten-&Aring;ke T&auml;rnlund, A Programming Language Based on a Natural Deduction
System, November 1981. 
(Report 6)
<LI> &Aring;ke Hansson and
Sten-&Aring;ke T&auml;rnlund, Program Transformation by Data Structure Mapping, November 1981. 
(Report 7)
<LI> &Aring;ke Hansson and Seif
Haridi and Sten-&Aring;ke T&auml;rnlund, Properties of a Logic Programming Language, November 1981. 
(Report 8)
<LI> Kenneth M. Kahn, The Implementation of Uniform---A
Knowledge-Representation/Programming Language Based upon Equivalence of
Descriptions, March 1982. 
(Report 9)
<LI> Stellan
Ohlsson, On the Automated Learning of Problem Solving Rules, July 1982. 
(Report 10)
<LI> Agneta Eriksson and Anna-Lena Johansson
and Sten-&Aring;ke T&auml;rnlund, Towards a Derivation Editor, revised November 1983.
(Report 11B)
<LI> Agneta Eriksson and
Anna-Lena Johansson, Computer-Based Synthesis of Logic Programs, August 1982. 
(Report 12)
<LI> Stellan Ohlsson, Transfer of Training in Procedural Learning: A Matter of
Conjectures and Refutations?, September 1982. 
(Report 13)
<LI> Kenneth M. Kahn, A Grammar Kit in Prolog, revised
by Mats Carlsson, February 1985. 
(Report 14C)
<LI> Kenneth M. Kahn, Unique Features of LISP Machine Prolog, revised
by Mats Carlsson, February 1985. 
(Report 15B)
<LI> Kenneth
M. Kahn, A Primitive for the Control of Logic Programs, February 1983. 
(Report 16)
<LI> Kenneth 
M. Kahn, A Partial Evaluator of LISP Written in Prolog, February 1983. 
(Report 17)
<LI> Anneli Edman
and Sten-&Aring;ke T&auml;rnlund, Mechanization of an Oracle in a Debugging System, April 1983. 
(Report 18)
<LI> Martin Nilsson, A Logical Model of Knowledge, June 1983. 
(Report 19)
<LI> Martin
Nilsson, FOOLOG---A Small and Efficient Prolog Interpreter, June 1983. 
(Report 20)
<LI> G&ouml;ran Hagert and &Aring;ke
Hansson, Logic Modelling of Cognitive Reasoning, July 1983. 
(Report 21)
<LI> Lars-Henrik Eriksson, Synthesis of a Unification Algorithm in a Logic Programming
Calculus, revised February 1984. 
(Report 22B)
<LI> Kenneth M. Kahn, Partial Evaluation as an Example of the Relationships between
Programming Methodology and Artificial Intelligence, October
1983. 
(Report 23)
<LI> Mats Carlsson and Kenneth M. Kahn, LM-Prolog User Manual, November
1983, revised April 1985. 
(Report 24)
<LI> G&ouml;ran Hagert and
&Aring;ke Hansson, Reasoning Models within a Logical Framework, April 1984. 
(Report 25)
<LI> Martin
Nilsson, Declarative Determinism in Prolog Implementations, August 1984. 
(Report 26)
<LI> Kenneth M. Kahn and Mats Carlsson, The Compilation of Prolog Programs without the Use of a Prolog 
Compiler, August 1984. 
(Report 27)
<LI> Martin
Nilsson, Prolog as a Tool for Optimizing Prolog Unifiers, August 1984. 
(Report 28)
<LI> Martin Nilsson, A Logical Model of Knowledge and Belief, October
1984. 
(Report 29)
<LI> Mats
Carlsson, LM-Prolog---the language and its implementation, October 1984. 
(Report 30)
<LI> Lennart Beckman, Semantics for a Computational Model for Parallel Execution of Logic
Programs, October 1985. 
(Report 31; out of print).
<LI> Agneta Eriksson and Anna-Lena 
Johansson, Neat Explanation of Proof Trees, October 1985. 
(Report 32)
<LI> Anna-Lena 
Johansson, Using Symmetry and Substitution in Program Derivation, 
December 1985. (Report 33)
<LI> Sten-&Aring;ke
T&auml;rnlund, Logic Programming---from a Logic Point of View, September 1986. 
(Report 34)
<LI> Mats
Carlsson, Compilation for Tricia and its Abstract Machine, September 1986. 
(Report 35)
<LI> Jonas Barklund, A Garbage Collection Algorithm for Tricia, December
1987. 
(<a href="0037.pdf">Report 37B</a>)
<LI> Jonas Barklund and H&aring;kan Millroth, Garbage Cut, October
1986. 
(<a href="0038.pdf">Report 38</a>)
<LI> Jonas
Barklund, Efficient Interpretation of Prolog Programs, April 1987. 
(<a href="0039.pdf">Report 39</a>)
<LI> Jonas Barklund and
H&aring;kan Millroth, Hash Tables in Logic Programming, April 1987. 
(<a href="0040.pdf">Report 40</a>)
<LI> Sven-Olof
Nystr&ouml;m, Guarded Horn Clauses, Application and Implementation, November 1987. 
(Report 41)
<LI> Jonas Barklund and
H&aring;kan Millroth, Integrating Complex Data Structures in Prolog, October 1987. 
(<a href="0042.pdf">Report 42</a>)
<LI> Sven-Olof
Nystr&ouml;m, An Abstract Machine for Guarded Horn Clauses, December 1987. 
(Report 43)
<LI> Mats
Nyl&eacute;n, List and Tree Matching on Fine-grained Parallel SIMD Computers, May 1988. 
(Report 44)
<LI> Anna-Lena Johansson, Simplifying Program Derivation by Using Program Schemas:
a Study of Transitive Closures, April 1988. 
(Report 45)
<LI> Jonas Barklund and H&aring;kan
Millroth, A Parallel Unification Algorithm, April 1989. 
(<a href="0046.pdf">Report 46</a>)
<LI> Jonas Barklund and Nils Hagner and Malik Wafin, Condition Graphs, June
1988. 
(<a href="0048.pdf">Report 48</a>)
<LI> Sven-Olof Nystr&ouml;m, Introducing Abstract Data Types with Inheritance into
Prolog, June 1988. 
(Report 49)
<LI> Jonas Barklund, What Is a Meta-variable in Prolog?, May 1988. 
(Report 50)
<LI> Jonas Barklund and
Nils Hagner and Malik Wafin, KL1 in Condition Graphs on a Connection Machine, May 1988. 
(Report 51)
<LI> Jonas Barklund and H&aring;kan Millroth, Nova Prolog, July 1988. 
(Report 52)
<LI> Peter Pavek, PICON and the Paper Industry, May 1987. 
(Report 53)
<LI> Anders Hjort and Peter Pavek, Pulp Expert, July 1988. 
(Report 54)
<LI> Andreas Hamfelt and Jonas Barklund, Metalevels in Legal Knowledge and their Runnable Representation in
Logic, June 1989. 
(Report 55)
<LI> Torkel
Hjerpe and Fredrik M&ouml;llerberg and Kent Andersson, Making Minimal Plans---Knowledge Based Plan Execution, September 1989. 
(Report 56)
<LI> Bj&ouml;rn Carlson and
Fredrik Kant and Jan W&uuml;nsche, A Scheme for Functions in Logic Programming, December 1989. 
(Report 57)
<LI> Johan Montelius, Improvements to an OR-parallel Execution Model for
Logic Programs, December 1989. 
(Report 58)
<LI> Keith L.
Clark, Logic Programming Schemes and their Implementations, March 1990. 
(Report 59)
<LI> Andreas Hamfelt and Jonas Barklund, An Intelligent Interface to Legal Data Bases Combining Logic Programming and
Hypertext, December 1989. 
(Report 60)
<LI> Jonas Barklund
and Andreas Hamfelt, Metaprogramming for Representation of Legal Principles, July 1990. 
(Report 61)
<LI> Monika Danielsson and Jonas Barklund, Persistent Data Storage for Prolog, July
1990. 
(Report 62)
<LI> Keith L. Clark, Parallel Logic Programming, September 1990. 
(Report 63)
<LI> Jonas
Barklund and Andreas Hamfelt and Jan W&uuml;nsche, A Modular Architecture for Knowledge Systems, September 1990. 
(Report 64)
<LI> Sven-Olof
Nystr&ouml;m, Variable-Free Execution of Concurrent Logic Languages, January 1990. 
(Report 65)
<LI> Andreas Hamfelt and &Aring;ke Hansson, Metalogic Representation of Stratified
Knowledge, April 1991. 
(Report 66)
<LI> H&aring;kan Millroth, Reforming Compilation of Logic Programs, July 1991. 
(<a href="0067.pdf">Report 67</a>)
<LI> Andreas Hamfelt and &Aring;ke Hansson, Representation of Fragmentary and Multilayered Knowledge---A Semiformal
Metatheory as an Interactive Metalogic Program, December
1991. 
(Report 68)
<LI> H&aring;kan Millroth, Using the Reform Inference System for Parallel Prolog, January
1992. 
(<a href="0069.pdf">Report 69</a>)
<LI> H&aring;kan Millroth, Compiling Nonlinear Recursion to Parallel Iteration, January
1992. 
(<a href="0070.pdf">Report 70</a>)
<LI> Jonas Barklund and H&aring;kan Millroth, Providing Iteration and Concurrency in Logic Programs through
Bounded Quantifications, September 1992. 
(Report 71)
<LI> Johan Bevemyr, The Luther WAM Emulator, March 1992. 
(<a href="0072.pdf">Report 72</a>)
<LI> Per
Mildner and Jonas Barklund, Design and Implementation of a Modular Real Time Expert System, November 1992. 
(Report 73)
<LI> Henrik Arro and Jonas Barklund
and Johan Bevemyr, Parallel Bounded Quantification---Preliminary Results, November 1992. 
(<a href="0074.pdf">Report 74</a>)
<LI> Johan Bevemyr and
Thomas Lindgren and H&aring;kan Millroth, Exploiting Recursion-Parallelism in Prolog, November 1993. 
(<a href="0075.pdf">Report 75</a>)
<LI> Johan Bevemyr and
Thomas Lindgren and H&aring;kan Millroth, Reform Prolog: The Language and its Implementation, November 1993. 
(<a href="0076.pdf">Report 76</a>)
<LI> Jonas Barklund
and Johan Bevemyr, Prolog with Arrays and Bounded Quantifications, September 1993. 
(<a href="0077.pdf">Report 77</a>)
<LI> Jonas
Barklund and Bharat Jayaraman and Jiro Tanaka (eds.), Parallel and Data 
		Parallel Execution of Logic Programs, June 1994. Proceedings.
(<a href="0078/"> Report 78 </a>)

<LI> Sven-Olof Nystr&ouml;m and Bengt Jonsson, Indeterminate Concurrent Constraint Programming: A
Fixpoint Semantics for Non-Terminating Computations, July 1994. 
(<a href="0079.pdf">Report 79</a>)
<LI> Jonas Barklund, Metaprogramming in Logic, July 1994. 
(<a href="0080.pdf"> Report 80 </a>)
<LI> Jonas Barklund and Katrin Boberg and Pierangelo Dell'Acqua, A Basis for a Multilevel Metalogic Programming Language, July 1994. 
(<a href="0081.pdf"> Report 81 </a>)
<LI> Jonas
Barklund, Tabulation of Functions in Definite Clause Programs, July 1994. 
(<a href="0082.pdf"> Report 82 </a>)
<LI> Jonas
Barklund and Stefania Costantini and Pierangelo Dell'Acqua and Gaetano
A. Lanzarone, Reflective Prolog = CLP(Names,Trees), July 1994. 
(Report 83)
<LI> Bj&ouml;rn Carlson and Mats Carlsson and Daniel Diaz,
Entailment of Finite Domain Constraints, August 1994. 
(<a href="0084.pdf">Report 84</a>)
<LI> Bj&ouml;rn Carlson and Seif Haridi and 
	Sverker Janson,
	AKL(FD) -- A Concurrent Language for  FD Programming, August 1994. 
(<a href="0085.pdf">Report 85</a>)
<LI> Thomas Lindgren, A Continuation-Passing Style for Prolog, August 1994. 
(<a href="0086.pdf">Report 86</a>).
<LI> Johan Bevemyr and Thomas Lindgren, A Simple and Efficient Copying 
	Garbage Collector for
	Prolog, August 1994. 
(<a href="0087.pdf">Report 87</a>)
<LI> Andrei Voronkov,
Implementing Bottom-up Procedures with Code Trees: a Case Study of Forward
Subsumption,
October 1994.
(<a href="0088.pdf">Report 88</a>)
</UL>

<ADDRESS>
Thomas Lindgren / thomasl@csd.uu.se, lindgren@sics.se
</ADDRESS>