References

1

H. Aï t-Kaci and R. Nasr. Integrating logic and functional programming. Lisp and Symbolic Computation, 2:51--89, 1989.

2

H. Aï t-Kaci and A. Podelski. Logic programming over order-sorted feature terms. In Extensions of logic programming, third international workshop, ELP93, number 660 in Lecture Notes in Artificial Intelligence. Springer-Verlag, 1993.

3

H. Aï t-Kaci and A. Podelski. Towards a meaning of life. Journal of Logic Programming, 16:195--234, 1993.

4

J. Anastasiadis and H. Kuchen. Higher order babel: Language and implementation. In Extensions of Logic Programming, ELP'96, Lecture Notes in Artificial Intelligence. Springer-Verlag, 1996.

5

S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy. In Proc. 21st ACM Symposium on Principles of Programming Languages, pages 268--279, 1994.

6

M. Aronsson. Methodology and programming techniques in GCLA II. In Extensions of logic programming, second international workshop, ELP'91, number 596 in Lecture Notes in Artificial Intelligence. Springer-Verlag, 1992.

7

M. Aronsson. GCLA, The Design, Use, and Implementation of a Program Development System. PhD thesis, Stockholm University, Stockholm, Sweden, 1993.

8

Y. Bekkers and P. Tarau. Logic programming with comprehensions and monads.

9

G. Falkman. Program separation as a basis for definitional higher order programming. In U. Engberg, K. Larsen, and P. Mosses, editors, Proceedings of the 6th Nordic Workshop on Programming Theory. Aarhus, 1994.

10

G. Falkman. Definitional program separation. Licentiate thesis, Chalmers University of Technology, 1996. Forthcoming.

11

G. Falkman and O. Torgersson. Programming methodologies in GCLA. In R. Dyckhoff, editor, Extensions of logic programming, ELP'93, number 798 in Lecture Notes in Artificial Intelligence, pages 120--151. Springer-Verlag, 1994.

12

G. Falkman and J. Warnby. Technical diagnoses of telecommunication equipment; an implementation of a task specific problem solving method (TDFL) using GCLA II. Research Report SICS R93:01, Swedish Institute of Computer Science, 1993.

13

E. Giovannetti, G. Levi, C. Moiso, and C. Palamidessi. Kernel-LEAF: A logic plus functional language. Journal of Computer and System Sciences, 42:139--185, 1991.

14

M. Gustafsson. Texttolkning med abduktion i GCLA. Master's thesis, Department of Linguistics, Göteborg University, 1994.

15

L. Hallnäs. Partial inductive definitions. Theoretical Computer Science, 87(1):115--142, 1991.

16

L. Hallnäs, M. Jontell, and N. Nazari. MEDVIEW -- formalisation of clinical experience in oral medicine and dermatology: The structure of basic data - abstract. In Proceedings of the Das Wintermöte'96, Chalmers, 1996.

17

L. Hallnäs and P. Schroeder-Heister. A proof-theoretic approach to logic programming. Journal of Logic and Computation, 1(5):635--660, 1991. Part 2: Programs as Definitions.

18

M. Hanus. Compiling logic programs with equality. In Proc. of the 2nd Int. Workshop om Programming Language Implementation and Logic Programming, number 456 in Lecture Notes in Computer Science, pages 387--401. Springer-Verlag, 1990.

19

M. Hanus. Improving control of logic programs by using functional languages. In Proc. of the 4th International Symposium on Programming Language Implementation and Logic Programming, number 631 in Lecture Notes in Computer Science, pages 1--23. Springer-Verlag, 1992.

20

M. Hanus. Combining lazy narrowing and simplification. In Proc. 6th International Symposium on Programming Language Implementation and Logic Programming, pages 370--384. Springer LNCS 844, 1994.

21

M. Hanus. The integration of functions into logic programming; from theory to practice. Journal of Logic Programming, 19/20:593--628, 1994.

22

M. Hanus, H. Kuchen, and J. Moreno-Navarro. Curry: A truly functional logic language. In Proc. ILPS'95 Workshop on Visions for the Future of Logic Programming, pages 95--107, 1995.

23

P. Hill and J. Lloyd. The Gödel Programming Language. Logic Programming Series. MIT Press, 1994.

24

P. Hudak et al. Report on the Programming Language Haskell: A Non-Strict, Purely Functional Language, March 1992. Version 1.2. Also in Sigplan Notices, May 1992.

25

P. Kreuger. GCLA II: A definitional approach to control. In Extensions of logic programming, second international workshop, ELP91, number 596 in Lecture Notes in Artificial Intelligence. Springer-Verlag, 1992.

26

P. Kreuger. Computational Issues in Calculi of Partial Inductive Definitions. PhD thesis, Department of Computing Science, University of Göteborg, Göteborg, Sweden, 1995.

27

J. Lloyd. Foundations of Logic Programming. Springer Verlag, second extended edition, 1987.

28

J. Lloyd. Combining functional and logic programming languages. In Proceedings of the 1994 International Logic Programming Symposium, ILPS'94, 1994.

29

J. W. Lloyd. Declarative programming in Escher. Technical Report CSTR-95-013, Department of Computer Science, University of Bristol, June 1995.

30

J. W. Lloyd. Practical advantages of declarative programming. In Joint Conference on Declarative Programming, GULP-PRODE'94, 94.

31

R. Loogen, F. López-Fraguas, and M. Rodrí guez-Artalejo. A demand driven computation strategy for lazy narrowing. In Proc. of the 5th International Symposium on Programming Language Implementation and Logic Programming,PLIP'93, number 714 in Lecture Notes in Computer Science, pages 184--200. Springer-Verlag, 1993.

32

R. Milner. Standard ML core language. Internal report CSR-168-84, University of Edinburgh, 1984.

33

J. J. Moreno-Navarro and M. Rodrí guez-Artalejo. Logic programming with functions and predicates: The language BABEL. Journal of Logic Programming, 12:191--223, 1992.

34

G. Nadathur and D. Miller. An overview of Prolog. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 810--827. MIT Press, 1988.

35

P. Padawitz. Computing in Horn Clause Theories, volume 16 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1988.

36

H. Siverbo and O. Torgersson. Perfect harmony---ett musikaliskt expertsystem. Master's thesis, Department of Computing Science, Göteborg University, January 1993. In swedish.

37

J. J. Slagle. Automated theorem-proving for theories with simplifiers, commutativity, and associativity. Journal Of the ACM, 21(4):622--642, 1974.

38

G. Smolka. The definition of kernel Oz. DFKI Oz documentation series, German Research Center for Artificial Intelligence (DFKI), 1994.

39

G. Smolka. The Oz programming model. In J. van Leeuwen, editor, Current Trends in Computer Science, number 1000 in Lecture Notes in Computer Science. Springer-Verlag, 1995.

40

O. Torgersson. Functional logic programming in GCLA. In U. Engberg, K. Larsen, and P. Mosses, editors, Proceedings of the 6th Nordic Workshop on Programming Theory. Aarhus, 1994.

41

O. Torgersson. A definitional approach to functional logic programming. In Extensions of Logic Programming, ELP'96, Lecture Notes in Artificial Intelligence. Springer-Verlag, 1996.

42

O. Torgersson. Definitional programming in GCLA: Techniques, functions, and predicates. Licentiate thesis, Chalmers University of Technology and Göteborg University, 1996.

43

P. Wadler. Comprehending Monads. In Proceedings of the 1990 ACM Symposium on Lisp and Functional Programming, Nice, France, 1990.