{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T14:12:30Z","timestamp":1725631950169},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540523376"},{"type":"electronic","value":"9783540469650"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52337-6_20","type":"book-chapter","created":{"date-parts":[[2011,11,9]],"date-time":"2011-11-09T21:16:49Z","timestamp":1320873409000},"page":"73-110","source":"Crossref","is-referenced-by-count":1,"title":["Types, modules and databases in the logic programming language PROTOS-L"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Beierle","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1145\/59287.59293","volume":"11","author":"H. A\u00eft-Kaci","year":"1989","unstructured":"H. A\u00eft-Kaci, R. Boyer, P. Lincoln, and R. Nasr. Efficient lattice operations. ACM Transactions on Programming Languages and Systems, 11(1):115\u2013146, January 1989.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"H.-J. Appelrath. Das EUREKA-Projekt PROTOS. In W. Brauer and W. Wahlster, editors, Proceedings GI-Kongre\u00df Wissensbasierte Systeme, pages 1\u201311, Springer-Verlag, Informatik-Fachberichte 155, 1987.","DOI":"10.1007\/978-3-642-88719-2_1"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"C. Beierle and S. B\u00f6ttcher. PROTOS-L: Towards a knowledge base programming language. In Proceedings GI-Kongre\u00df Wissensbasierte Systeme, Springer-Verlag, 1989. (to appear).","DOI":"10.1007\/978-3-642-75182-0_37"},{"key":"6_CR4","unstructured":"S. B\u00f6ttcher. The architecture of the PROTOS-L system. In H.-J. Appelrath, A. B. Cremers, and H. Schiltknecht, editors, Proc. First PROTOS Workshop, Morcote, Switzerland, 1988."},{"key":"6_CR5","unstructured":"S. B\u00f6ttcher and C. Beierle. Data base support for the PROTOS-L system. In Proceedings EUROMICRO-89, North Holland, 1989. (to appear)."},{"key":"6_CR6","unstructured":"H.-J. B\u00fcrckert. Extending the WARREN Abstract Machine to Many-Sorted Prolog. SEKI-Memo-85-07, FB Informatik, Universit\u00e4t Kaiserslautern, 1985."},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1145\/6041.6042","volume":"17","author":"L. Cardelli","year":"1985","unstructured":"L. Cardelli and P. Wegner. On understanding types, data abstraction and polymorphism. ACM Computing Surveys, 17(4):471\u2013522, December 1985.","journal-title":"ACM Computing Surveys"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF00243207","volume":"3","author":"A. G. Cohn","year":"1987","unstructured":"A. G. Cohn. A more expressive formulation of many sorted logic. Journal of Automated Reasoning, 3:113\u2013200, 1987.","journal-title":"Journal of Automated Reasoning"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"L. Damas and R. Milner. Principal type-schemes for functional programs. In Proceedings of the 9th ACM Symposium on Principles of Programming Languages, pages 207\u2013212, 1982.","DOI":"10.1145\/582153.582176"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/3-540-50667-5_64","volume-title":"Algebraic and Logic Programming","author":"G. Dayantis","year":"1988","unstructured":"G. Dayantis. Types, modules and abstraction in logic programming. In J. Grabowski, P. Lescanne, and W. Wechler, editors, Algebraic and Logic Programming, pages 127\u2013136, Akademie-Verlag, Berlin, 1988."},{"key":"6_CR11","unstructured":"Douglas DeGroot and Gary Lindstrom, editors. Functional and Logic Programming. Prentice Hall, 1986."},{"key":"6_CR12","series-title":"Lectures Notes in Computer Science","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/3-540-19027-9_6","volume-title":"Proceedings of the 2nd European Symposium on Programming","author":"R. Dietrich","year":"1988","unstructured":"R. Dietrich and F. Hagl. A polymorphic type system with subtypes for Prolog. In Proceedings of the 2nd European Symposium on Programming, pages 79\u201393, Lectures Notes in Computer Science, Volume 300, Springer-Verlag, Berlin, Heidelberg, New York, 1988."},{"key":"6_CR13","volume-title":"Fundamentals of Algebraic Specification 1 \u2014 Equations and Initial Semantics. EATCS Monographs on Theoretical Computer Science, Volume 6","author":"H. Ehrig","year":"1985","unstructured":"Harmut Ehrig and Bernd Mahr. Fundamentals of Algebraic Specification 1 \u2014 Equations and Initial Semantics. EATCS Monographs on Theoretical Computer Science, Volume 6, Springer-Verlag, Berlin, Heidelberg, New York, 1985."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In B. Reid, editor, Proceedings of 12th ACM Conference on Principles of Programming Languages, pages 52\u201366, ACM, 1985.","DOI":"10.1145\/318593.318610"},{"key":"6_CR15","series-title":"Technical Report","volume-title":"A Tutorial on the Warren Abstract Machine","author":"J. Gabriel","year":"1985","unstructured":"J. Gabriel, T. Lindholm, E. L. Lusk, and R. A. Overbeek. A Tutorial on the Warren Abstract Machine. Technical Report, Mathematics and Computer Science Department, Argonne National Laboratory, Argonne, Illinois, 1985."},{"key":"6_CR16","series-title":"PROTOS Document","volume-title":"Logisches Clustering von PROTOS-L Prozeduren","author":"C. Garidis","year":"1988","unstructured":"C. Garidis. Logisches Clustering von PROTOS-L Prozeduren. PROTOS Document B.4, IBM Germany, Stuttgart, 1988."},{"key":"6_CR17","unstructured":"M. Gogolla. \u00dcber partiell geordnete Sortenmengen und deren Anwendung zur Fehlerbehandlung in abstrakten Datentypen. PhD thesis, TU Braunschweig, 1986."},{"key":"6_CR18","series-title":"Semantics and Theory of Computation Report","volume-title":"Order Sorted Algebra","author":"J. Goguen","year":"1978","unstructured":"J. Goguen. Order Sorted Algebra. Semantics and Theory of Computation Report No. 14, University of California, Los Angeles, 1978."},{"key":"6_CR19","unstructured":"Joseph A. Goguen and Jose Meseguer. Eqlog: equality, types, and generic modules for logic programming. In Douglas De-Groot and Gary Lindstrom, editors, Functional and Logic Programming, pages 295\u2013363, Prentice Hall, 1986."},{"key":"6_CR20","series-title":"Technical Report","volume-title":"Order-Sorted Algebra I: Partial and Overloaded Operators, Errors and Inheritance","author":"J. A. Goguen","year":"1987","unstructured":"J. A. Goguen and J. Meseguer. Order-Sorted Algebra I: Partial and Overloaded Operators, Errors and Inheritance. Technical Report, Computer Science Lab., SRI International, Menlo Park, 1987."},{"key":"6_CR21","unstructured":"Joseph A. Goguen, James W. Thatcher, and Eric G. Wagner. An initial algebra approach to the specification, correctness and implementation of abstract data types. In R. Yeh, editor, Current Trends in Programming Methodology IV: Data and Structuring, pages 80\u2013144, Prentice Hall, 1978."},{"key":"6_CR22","unstructured":"M. Hanus. Horn Clause Specifications with Polymorphic Types. PhD thesis, FB Informatik, Universit\u00e4t Dortmund, 1988."},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"M. Hanus. Horn clause programs with polymorphic types. In Proceedings TAPSOFT'89, Springer-Verlag, 1989.","DOI":"10.1007\/3-540-50940-2_38"},{"key":"6_CR24","unstructured":"M. Huber and I. Varsek. Extended Prolog for ordersorted resolution. In Proceedings of the 4th IEEE Symposium on Logic Programming, pages 34\u201345, San Francisco, 1987."},{"key":"6_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-96826-6","volume-title":"Foundations of Logic Programming. Symbolic Computation","author":"J. W. Lloyd","year":"1984","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Symbolic Computation, Springer-Verlag, Berlin, Heidelberg, New York, 1984."},{"issue":"2","key":"6_CR26","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"A. Martelli and U. Montanari. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems, 4(2):258\u2013282, 1982.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"R. Milner. A Theory of Type Polymorphism in Programming. Journal of Computer and System Science, 17:348\u2013375, 1978.","journal-title":"Journal of Computer and System Science"},{"key":"6_CR28","series-title":"Studienarbeit","volume-title":"Entwurf und Implementierung einer abstrakten Maschine f\u00fcr ordnungsortierte Logikprogramme","author":"B. M\u00fcller","year":"1988","unstructured":"B. M\u00fcller. Entwurf und Implementierung einer abstrakten Maschine f\u00fcr ordnungsortierte Logikprogramme. Studienarbeit Nr. 711, Universit\u00e4t Stuttgart und IBM Deutschland GmbH, Stuttgart, October 1988."},{"key":"6_CR29","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0004-3702(84)90017-1","volume":"23","author":"A. Mycroft","year":"1984","unstructured":"A. Mycroft and R. A. O'Keefe. A polymorphic type system for Prolog. Artificial Intelligence, 23:295\u2013307, 1984.","journal-title":"Artificial Intelligence"},{"key":"6_CR30","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF01396685","volume":"145","author":"A. Oberschelp","year":"1962","unstructured":"A. Oberschelp. Untersuchungen zur mehrsortigen Quantorenlogik. Mathematische Annalen, 145:297\u2013333, 1962.","journal-title":"Mathematische Annalen"},{"key":"6_CR31","unstructured":"M. Schmidt-Schau\u00df. A many-sorted calculus with polymorphic functions based on resolution and paramodulation. In Proceedings of the 9th International Conference on Artificial Intelligence, pages 1162\u20131168, Kaufmann, 1985."},{"key":"6_CR32","series-title":"Studienarbeit","volume-title":"Erweiterung eines Prolog-Interpreters um Typbehandlung","author":"H. Sch\u00fctze","year":"1988","unstructured":"H. Sch\u00fctze. Erweiterung eines Prolog-Interpreters um Typbehandlung. Studienarbeit Nr. 710, Universit\u00e4t Stuttgart und IBM Deutschland GmbH, Stuttgart, August 1988."},{"key":"6_CR33","series-title":"Diplomarbeit","volume-title":"Erweiterung einer abstrakten Maschine f\u00fcr ordnungssortiertes Prolog um die Behandlung polymorpher Sorten","author":"H. Semle","year":"1989","unstructured":"H. Semle. Erweiterung einer abstrakten Maschine f\u00fcr ordnungssortiertes Prolog um die Behandlung polymorpher Sorten. Diplomarbeit Nr. 583, Universit\u00e4t Stuttgart und IBM Deutschland GmbH, Stuttgart, April 1989."},{"key":"6_CR34","volume-title":"Algebraic and Logic Programming","author":"G. Smolka","year":"1988","unstructured":"G. Smolka. Logic programming with polymorphically ordersorted types. In J. Grabowski, P. Lescanne, and W. Wechler, editors, Algebraic and Logic Programming, Akademie-Verlag, Berlin, 1988."},{"key":"6_CR35","unstructured":"G. Smolka. TEL (Version 0.9), Report and User Manual. SEKI-Report SR 87-17, FB Informatik, Universit\u00e4t Kaiserslautern, 1988."},{"key":"6_CR36","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":"6_CR37","unstructured":"G. Smolka, W. Nutt, J. A. Goguen, and J. Meseguer. Order-Sorted Equational Computation. SEKI-Report SR 87-14, FB Informatik, Universit\u00e4t Kaiserslautern, 1987. (to appear in: H. Ait-Kaci, M. Nivat (eds): Resolution of Equations in Algebraic Structures, Academic Press)."},{"key":"6_CR38","unstructured":"U. Waldmann. Unification in Order-Sorted Signatures. Forschungsbericht Nr. 298, FB Informatik, Universit\u00e4t Dortmund, 1989."},{"key":"6_CR39","volume-title":"A Many-Sorted Calculus Based on Resolution and Paramodulation","author":"C. Walther","year":"1987","unstructured":"C. Walther. A Many-Sorted Calculus Based on Resolution and Paramodulation. Research Notes in Artificial Intelligence, Pitman, London, and Morgan Kaufmann, Los Altos, Calif., 1987."},{"issue":"1","key":"6_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/42267.45071","volume":"35","author":"C. Walther","year":"1988","unstructured":"C. Walther. Many-sorted unification. Journal of the ACM, 35(1):1\u201317, January 1988.","journal-title":"Journal of the ACM"},{"key":"6_CR41","unstructured":"D. Warren. Compiling Predicate Logic Programs. D.A.I. Research Report, University of Edinburgh, 1977."},{"key":"6_CR42","unstructured":"D. Warren. An Abstract PROLOG Instruction Set. Technical Report 309, SRI, 1983."}],"container-title":["Lecture Notes in Computer Science","Sorts and Types in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52337-6_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:24:00Z","timestamp":1605648240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52337-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540523376","9783540469650"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/3-540-52337-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}