{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:38:13Z","timestamp":1725489493278},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540427520"},{"type":"electronic","value":"9783540455042"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45504-3_8","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T18:56:02Z","timestamp":1187031362000},"page":"114-129","source":"Crossref","is-referenced-by-count":0,"title":["Modeling Meta-logical Features in a Calculus with Frozen Variables"],"prefix":"10.1007","author":[{"given":"Birgit","family":"Elbl","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,2]]},"reference":[{"issue":"1 and 2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0743-1066(92)90045-5","volume":"14","author":"M. Baudinet","year":"1992","unstructured":"M. Baudinet. Proving termination properties of Prolog programs: A semantic approach. Journal of Logic Programming, 14(1 and 2):1\u201329, October 1992.","journal-title":"Journal of Logic Programming"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"E. B\u00f6rger and D. Rosenzweig. A mathematical definition of full Prolog. Science of Computer Programming, 24(3):249.","DOI":"10.1016\/0167-6423(95)00006-E"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0743-1066(88)90007-6","volume":"5","author":"S. K. Debray","year":"1988","unstructured":"S. K. Debray and P. Mishra. Denotational and operational semantics for Prolog. Journal of Logic Programming, 5(1):61\u201391, March 1988.","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0743-1066(98)10040-7","volume":"41","author":"B. Elbl","year":"1999","unstructured":"B. Elbl. A declarative semantics for depth-first logic programs. Journal of Logic Programming, 41(1):27\u201366, 1999.","journal-title":"Journal of Logic Programming"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"B. Elbl. Lazy list comprehension in logic programming. Journal of Logic and Computation, (to appear).","DOI":"10.1093\/logcom\/12.5.747"},{"issue":"3","key":"8_CR6","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1142\/S0129054101000540","volume":"12","author":"B. Elbl","year":"2001","unstructured":"B. Elbl. A non-definability result for a predicational language with the usual control. International Journal of Foundations of Computer Science, 12(3):385\u2013396, 2001.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"J.-Y. Girard. Linear logic. Theoretical Computer Science, 50, 1987.","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"8_CR8","unstructured":"N. D. Jones and A. Mycroft. Stepwise development of operational and denotational semantics for Prolog. In Proceedings of the 1984 International Symposium on Logic Programming, pages 281\u2013288. IEEE, 1984."},{"issue":"4","key":"8_CR9","first-page":"367","volume":"35","author":"G. E. Mints","year":"1986","unstructured":"G. E. Mints. Complete calculus for pure prolog. Proc. Acad. Sci. Estonian SSR, 35(4):367\u2013380, 1986.","journal-title":"Proc. Acad. Sci. Estonian SSR"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"P. Schroeder-Heister. Definitional reflection and the completion. In R. Dyckhoff, editor, Extensions of Logic Programming. Fourth International Workshop, St. Andrews, Scotland, April 1993, Proceedings, Springer Lecture Notes in Artificial Intelligence, pages 333\u2013347, 1994.","DOI":"10.1007\/3-540-58025-5_65"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0168-0072(92)90065-8","volume":"56","author":"J. Shepherdson","year":"1992","unstructured":"J. Shepherdson. Mints type deductive calculi for logic programming. Annals of Pure and Applied Logic, 56:7\u201317, 1992.","journal-title":"Annals of Pure and Applied Logic"},{"key":"8_CR12","unstructured":"L. Sterling and E. Y. Shapiro. The Art of Prolog. MIT Press, 1986."}],"container-title":["Lecture Notes in Computer Science","Proof Theory in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45504-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T01:15:05Z","timestamp":1547860505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45504-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427520","9783540455042"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45504-3_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}