{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:13:15Z","timestamp":1725459195344},"publisher-location":"Berlin\/Heidelberg","reference-count":19,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354053590X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0038692","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T14:16:05Z","timestamp":1138198565000},"page":"49-99","source":"Crossref","is-referenced-by-count":3,"title":["A survey of GCLA: A definitional approach to logic programming"],"prefix":"10.1007","author":[{"given":"Martin","family":"Aronsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars-Henrik","family":"Eriksson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Halln\u00e4s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Per","family":"Kreuger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"M. Aronsson, The GCLA User's Manual, Technical Report SICS T89012, Swedish Institute of Computer Science, 1989."},{"key":"3_CR2","unstructured":"M. Aronsson, GAM, An Abstract Machine for GCLA, Research Report SICS R89002, Swedish Institute of Computer Science, 1989."},{"issue":"4","key":"3_CR3","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF03037453","volume":"7","author":"M. Aronsson","year":"1990","unstructured":"M. Aronsson, L-H. Eriksson, A. G\u00e4redal, L. Halln\u00e4s, P. Olin, The Programming Language GCLA: A Definitional Approach to Logic Programming, New Generation Computing 7(4), pp. 381\u2013404, 1990.","journal-title":"New Generation Computing"},{"issue":"4","key":"3_CR4","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF03037077","volume":"3","author":"K. A. Bowen","year":"1985","unstructured":"K. A. Bowen, Meta-Level Programming and Knowledge Representation, New Generation Computing, 3(4), pp. 359\u2013383, 1985.","journal-title":"New Generation Computing"},{"key":"3_CR5","unstructured":"L.-H. Eriksson, L. Halln\u00e4s, A Programming Calculus Based on Partial Inductive Definitions, Research Report SICS R88013, Swedish Institute of Computer Science."},{"key":"3_CR6","unstructured":"L.-H. Eriksson, A Finite Version of the Calculus of Partial Inductive Definitions, SICS Research Report in preparation."},{"key":"3_CR7","unstructured":"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."},{"key":"3_CR8","unstructured":"J.R.W. Glauert, K. Hammond, Implementing Pattern-Matching Functional Languages using Dactl, Internal Report, University of East Anglia, 1988."},{"issue":"4","key":"3_CR9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0743-1066(84)90029-3","volume":"1","author":"D.M. Gabbay","year":"1984","unstructured":"D.M. Gabbay, U. Reyle, N-PROLOG: An Extension of Prolog with Hypothetical Implications: I, Journal of Logic Programming, 1(4), pp. 319\u2013355,1984.","journal-title":"Journal of Logic Programming"},{"key":"3_CR10","unstructured":"L. Halln\u00e4s, 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."},{"issue":"1","key":"3_CR11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF03037052","volume":"2","author":"M. Hagiya","year":"1984","unstructured":"M. Hagiya, T. Sakurai, Foundation of Logic Programming Based on Inductive Definition, New Generation Computing, 2(1), pp. 59\u201377, 1984.","journal-title":"New Generation Computing"},{"key":"3_CR12","unstructured":"L. Halln\u00e4s, 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."},{"issue":"7","key":"3_CR13","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1145\/359131.359136","volume":"22","author":"R. Kowalski","year":"1979","unstructured":"R. Kowalski, Algorithm = Logic + Control, Communications of the ACM 22(7), pp. 424\u2013436, 1979.","journal-title":"Communications of the ACM"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd, Foundations of Logic Programming, Springer Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"issue":"1\u20132","key":"3_CR15","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0743-1066(89)90031-9","volume":"6","author":"D. Miller","year":"1989","unstructured":"D. Miller, A Logical Analysis of Modules in Logic Programming, Journal of Logic Programming 6(1\u20132), pp. 79\u2013108, 1989.","journal-title":"Journal of Logic Programming"},{"key":"3_CR16","volume-title":"Proceedings of 6th ICLP","author":"L. Monteiro","year":"1989","unstructured":"L. Monteiro, A. Porto, Contextual Logic Programming, in Proceedings of 6th ICLP, Lisbon, Portugal, The MIT Press, 1989."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"L. Naish, Negation and Quantifiers in NU-Prolog, In Proceedings of the Third International Conference on Logic Programming, pp. 624\u2013634, Springer Verlag Berlin, 1986.","DOI":"10.1007\/3-540-16492-8_111"},{"key":"3_CR18","unstructured":"L. Paulson, Tactics and Tacticals in Cambridge LCF Tech. Report No 39, Computer Laboratory, University of Cambridge."},{"key":"3_CR19","unstructured":"D.H.D Warren, An Abstract Prolog Instruction Set, Technical Note 309, SRI International, October 1983."}],"container-title":["Lecture Notes in Computer Science","Extensions of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0038692.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:23:40Z","timestamp":1607552620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0038692"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354053590X"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0038692","relation":{},"subject":[]}}