{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:21:04Z","timestamp":1725456064183},"publisher-location":"Berlin\/Heidelberg","reference-count":16,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055789X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023755","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:11:10Z","timestamp":1132395070000},"page":"15-34","source":"Crossref","is-referenced-by-count":4,"title":["Correctness proof for the WAM with types"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Beierle","sequence":"first","affiliation":[]},{"given":"Egon","family":"B\u00f6rger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7160.001.0001","volume-title":"Warren's Abstract Machine: A Tutorial Reconstruction","author":"H. A\u00eft-Kaci","year":"1991","unstructured":"H. A\u00eft-Kaci. Warren's Abstract Machine: A Tutorial Reconstruction. MIT Press, Cambridge, MA, 1991."},{"key":"2_CR2","series-title":"LNAI 418","volume-title":"Sorts and Types for Artificial Intelligence","author":"C. Beierle","year":"1990","unstructured":"C. Beierle. Types, modules and databases in the logic programming language PROTOSL. In K. H. Bl\u00e4sius, U. Hedtst\u00fcck, and C.-R. Rollinger, editors, Sorts and Types for Artificial Intelligence. LNAI 418, Springer-Verlag, Berlin, Heidelberg, New York, 1990."},{"key":"2_CR3","volume-title":"IWBS Report 200","author":"C. Beierle","year":"1991","unstructured":"C. Beierle and E. B\u00f6rger. A WAM extension for type-constraint logic programming: Specification and correctness proof. IWBS Report 200, IBM Germany, Scientific Center, Inst. for Knowledge Based Systems, Stuttgart, 1991."},{"key":"2_CR4","first-page":"272","volume-title":"Logic Programing: Proceedings of the 1991 International Symposium","author":"C. Beierle","year":"1991","unstructured":"C. Beierle, G. Meyer, and H. Semle. Extending the Warren Abstract Machine to polymorphic order-sorted resolution. In V. Saraswat and K. Ueda, editors, Logic Programing: Proceedings of the 1991 International Symposium, pages 272\u2013286, MIT Press, Cambridge, MA, 1991."},{"key":"2_CR5","series-title":"LNCS 440","first-page":"36","volume-title":"CSL'89 \u2014 3rd Workshop on Computer Science Logic","author":"E. B\u00f6rger","year":"1990","unstructured":"E. B\u00f6rger. A logical operational semantics of full Prolog. Part I. Selection core and control. In E. B\u00f6rger, H. Kleine B\u00fcning, and M. M. Richter, editors, CSL'89 \u2014 3rd Workshop on Computer Science Logic. LNCS 440, pages 36\u201364, Springer-Verlag, Berlin, Heidelberg, New York, 1990."},{"key":"2_CR6","series-title":"LNCS 452","first-page":"1","volume-title":"MFCS'90 \u2014 Mathematical Foundations of Computer Science","author":"E. B\u00f6rger","year":"1990","unstructured":"E. B\u00f6rger. A logical operational semantics of full Prolog. Part II. Built-in predicates for database manipulations. In B. Rovan, editor, MFCS'90 \u2014 Mathematical Foundations of Computer Science. LNCS 452, pages 1\u201314, Springer-Verlag, Berlin, Heidelberg, New York, 1990."},{"key":"2_CR7","series-title":"LNCS 533","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-54487-9_51","volume-title":"Computer Science Logic","author":"E. B\u00f6rger","year":"1991","unstructured":"E. B\u00f6rger and D. Rosenzweig. From Prolog algebras towards WAM \u2014 a mathematical study of implementation. In E. B\u00f6rger, H. Kleine B\u00fcning, M. M. Richter, and W. Sch\u00f6nfeld, editors, Computer Science Logic. LNCS 533, pages 31\u201366, Springer-Verlag, Berlin, Heidelberg, New York, 1991."},{"key":"2_CR8","unstructured":"E. B\u00f6rger and D. Rosenzweig. WAM algebras-a mathematical study of implementation, Part II. In Russian Conference on Logic Programming '91. LNCS, Springer-Verlag, 1992. (to appear). Preliminary version in: Technical Report CSE-TR-88-91, The University of Michigan, Department of Electrical Engineering and Computer Science, Ann Arbor, Michigan."},{"key":"2_CR9","series-title":"LNCS 533","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/3-540-54487-9_52","volume-title":"Computer Science Logic","author":"E. B\u00f6rger","year":"1991","unstructured":"E. B\u00f6rger and P. H. Schmitt. A formal operational semantics for languages of type Prolog III. In E. B\u00f6rger, H. Kleine B\u00fcning, M. M. Richter, and W. Sch\u00f6nfeld, editors, Computer Science Logic. LNCS 533, pages 67\u201379, Springer-Verlag, Berlin, Heidelberg, New York, 1991."},{"key":"2_CR10","unstructured":"Y. Gurevich. Evolving algebras. A tutorial introduction. EATCS Bulletin, 43, February 1991."},{"key":"2_CR11","unstructured":"Y. Gurevich. Logic and the challenge of computer science. In E. B\u00f6rger, editor, Trends in Theoretical Computer Science, pages 1\u201357, Computer Science Press, 1988."},{"key":"2_CR12","volume-title":"Technical Report ACT-ST-292-89","author":"D. M. Russinoff","year":"1989","unstructured":"D. M. Russinoff. A Verified Prolog Compiler for the Warren Abstract Machine. Technical Report ACT-ST-292-89, MCC, Austin, Texas, 1989. (To appear in Journal of Logic Programming)."},{"key":"2_CR13","volume-title":"Diplomarbeit Nr. 583","author":"H. Semle","year":"1989","unstructured":"H. Semle. Extension of an Abstract Machine for Order-Sorted Prolog to Polymorphism. Diplomarbeit Nr. 583, Universit\u00e4t Stuttgart und IBM Deutschland GmbH, Stuttgart, April 1989. (in German)."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"G. Smolka. Logic Programming over Polymorphically Order-Sorted Types. PhD thesis, FB Informatik, Univ. Kaiserslautern, 1989.","DOI":"10.1007\/3-540-50667-5_58"},{"key":"2_CR15","unstructured":"G. Smolka. TEL (Version 0.9), Report and User Manual SEKI-Report SR 87-17, FB Informatik, Universit\u00e4t Kaiserslautern, 1988."},{"key":"2_CR16","unstructured":"D. Warren. An Abstract PROLOG Instruction Set. Technical Report 309, SRI, 1983."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023755.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:50:26Z","timestamp":1607550626000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023755"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055789X"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0023755","relation":{},"subject":[]}}