This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Aronsson, The GCLA User's Manual, Technical Report SICS T89012, Swedish Institute of Computer Science, 1989.
M. Aronsson, GAM, An Abstract Machine for GCLA, Research Report SICS R89002, Swedish Institute of Computer Science, 1989.
M. Aronsson, L-H. Eriksson, A. Gäredal, L. Hallnäs, P. Olin, The Programming Language GCLA: A Definitional Approach to Logic Programming, New Generation Computing 7(4), pp. 381–404, 1990.
K. A. Bowen, Meta-Level Programming and Knowledge Representation, New Generation Computing, 3(4), pp. 359–383, 1985.
L.-H. Eriksson, L. Hallnäs, A Programming Calculus Based on Partial Inductive Definitions, Research Report SICS R88013, Swedish Institute of Computer Science.
L.-H. Eriksson, A Finite Version of the Calculus of Partial Inductive Definitions, SICS Research Report in preparation.
Fredholm D, Serafimovski S, Partial inductive Definitions as Typesystems for Lambda Terms, in Proceedings of the Workshop on Programming Logic, Chalmers University of Technology, 1990.
J.R.W. Glauert, K. Hammond, Implementing Pattern-Matching Functional Languages using Dactl, Internal Report, University of East Anglia, 1988.
D.M. Gabbay, U. Reyle, N-PROLOG: An Extension of Prolog with Hypothetical Implications: I, Journal of Logic Programming, 1(4), pp. 319–355,1984.
L. Hallnäs, Partial Inductive Definitions, In A. Avron et.al., editor, Workshop on General Logic, Report ECS-LFCS-88-52. Department of Computer Science, University of Edinburgh, 1987. Also published as Research Report SICS R86005C by the Swedish Institute of Computer Science, 1988. A revised version to appear in Theoretical Computer Science.
M. Hagiya, T. Sakurai, Foundation of Logic Programming Based on Inductive Definition, New Generation Computing, 2(1), pp. 59–77, 1984.
L. Hallnäs, P. Schroeder-Heister, A Proof-Theoretic Approach to Logic Programming, Research Report SICS R88005, Swedish Institute of Computer Science, 1988. A revised version to appear in the Journal of Logic and Computation, 1990.
R. Kowalski, Algorithm = Logic + Control, Communications of the ACM 22(7), pp. 424–436, 1979.
J.W. Lloyd, Foundations of Logic Programming, Springer Verlag, 1987.
D. Miller, A Logical Analysis of Modules in Logic Programming, Journal of Logic Programming 6(1–2), pp. 79–108, 1989.
L. Monteiro, A. Porto, Contextual Logic Programming, in Proceedings of 6th ICLP, Lisbon, Portugal, The MIT Press, 1989.
L. Naish, Negation and Quantifiers in NU-Prolog, In Proceedings of the Third International Conference on Logic Programming, pp. 624–634, Springer Verlag Berlin, 1986.
L. Paulson, Tactics and Tacticals in Cambridge LCF Tech. Report No 39, Computer Laboratory, University of Cambridge.
D.H.D Warren, An Abstract Prolog Instruction Set, Technical Note 309, SRI International, October 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aronsson, M., Eriksson, LH., Hallnäs, L., Kreuger, P. (1991). A survey of GCLA: A definitional approach to logic programming. In: Schroeder-Heister, P. (eds) Extensions of Logic Programming. ELP 1989. Lecture Notes in Computer Science, vol 475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0038692
Download citation
DOI: https://doi.org/10.1007/BFb0038692
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53590-4
Online ISBN: 978-3-540-46879-0
eBook Packages: Springer Book Archive