{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:37Z","timestamp":1725663877018},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540539810"},{"type":"electronic","value":"9783540464990"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3540539816_67","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:19:08Z","timestamp":1330190348000},"page":"181-200","source":"Crossref","is-referenced-by-count":10,"title":["Parametric order-sorted types in logic programming"],"prefix":"10.1007","author":[{"given":"Michael","family":"Hanus","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,6]]},"reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","volume":"29","author":"K.R. Apt","year":"1982","unstructured":"K.R. Apt and M.H. van Emden. Contributions to the Theory of Logic Programming. Journal of the ACM, Vol. 29, No. 3, pp. 841\u2013862, 1982.","journal-title":"Journal of the ACM"},{"unstructured":"P.G. Bosco and E. Giovannetti. IDEAL: An Ideal Deductive Applicative Language. In Proc. IEEE Internat. Symposium on Logic Programming, pp. 89\u201394, Salt Lake City, 1986.","key":"13_CR2"},{"unstructured":"R. Barbuti and R. Giacobazzi. A Bottom-Up Polymorphic Type Inference in Logic Programming. Technical Report 27\/89, Dip. di Informatica, Universit\u00e0 di Pisa, 1989.","key":"13_CR3"},{"unstructured":"M.H.M. Cheng, M.H. van Emden, and B.E. Richards. On Warren's Method for Functional Programming in Logic. Report LP-12 DCS-122-IR, Univ. of Victoria, 1989.","key":"13_CR4"},{"issue":"4","key":"13_CR5","doi-asserted-by":"crossref","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, Vol. 17, No. 4, pp. 471\u2013523, 1985.","journal-title":"acm computing surveys"},{"unstructured":"H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 1: Equations and Initial Semantics, volume 6 of EATCS Monographs on Theoretical Computer Science. Springer, 1985.","key":"13_CR6"},{"doi-asserted-by":"crossref","unstructured":"Y.-C. Fuh and P. Mishra. Type Inference with Subtypes. In Proc. ESOP 88, Nancy, pp. 94\u2013114. Springer LNCS 300, 1988.","key":"13_CR7","DOI":"10.1007\/3-540-19027-9_7"},{"unstructured":"J.A. Goguen and J. Meseguer. Completeness of Many-Sorted Equational Logic. Report No. CSLI-84-15, Stanford University, 1984.","key":"13_CR8"},{"doi-asserted-by":"crossref","unstructured":"M. Hanus. Horn Clause Programs with Polymorphic Types: Semantics and Resolution. In Proc. of the TAPSOFT '89, pp. 225\u2013240. Springer LNCS 352, 1989. Extended version to appear in Theoretical Computer Science.","key":"13_CR9","DOI":"10.1007\/3-540-50940-2_38"},{"unstructured":"M. Hanus. Polymorphic Higher-Order Programming in Prolog. In Proc. Sixth International Conference on Logic Programming (Lisboa), pp. 382\u2013397. MIT Press, 1989.","key":"13_CR10"},{"doi-asserted-by":"crossref","unstructured":"M. Hanus. Logic Programs with Equational Type Specifications. In Proc. of the 2nd International Conference on Algebraic and Logic Programming, pp. 70\u201385. Springer LNCS 463, 1990.","key":"13_CR11","DOI":"10.1007\/3-540-53162-9_31"},{"doi-asserted-by":"crossref","unstructured":"M. Hanus. Parametric Order-Sorted Types in Logic Programming. Technical Report, FB Informatik, Univ. Dortmund, 1991.","key":"13_CR12","DOI":"10.1007\/3540539816_67"},{"unstructured":"P.M. Hill and R.W. Topor. A Semantics for Typed Logic Programs. Report TR-90-11, Computer Science Department, University of Bristol, 1990.","key":"13_CR13"},{"unstructured":"M. Huber and I. Varsek. Extended Prolog with Order-Sorted Resolution. In Proc. 4th IEEE Internat. Symposium on Logic Programming, pp. 34\u201343, San Francisco, 1987.","key":"13_CR14"},{"doi-asserted-by":"crossref","unstructured":"J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In Proc. of the 14th ACM Symposium on Principles of Programming Languages, pp. 111\u2013119, Munich, 1987.","key":"13_CR15","DOI":"10.1145\/41625.41635"},{"doi-asserted-by":"crossref","unstructured":"J.W. Lloyd. Foundations of Logic Programming. Springer, second, extended edition, 1987.","key":"13_CR16","DOI":"10.1007\/978-3-642-83189-8"},{"unstructured":"P. Mishra. Towards a theory of types in Prolog. In Proc. IEEE Internat. Symposium on Logic Programming, pp. 289\u2013298, Atlantic City, 1984.","key":"13_CR17"},{"doi-asserted-by":"crossref","unstructured":"D.A. Miller and G. Nadathur. Higher-Order Logic Programming. In Proc. Third International Conference on Logic Programming (London), pp. 448\u2013462. Springer LNCS 225, 1986.","key":"13_CR18","DOI":"10.1007\/3-540-16492-8_94"},{"key":"13_CR19","doi-asserted-by":"crossref","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, Vol. 23, pp. 295\u2013307, 1984.","journal-title":"Artificial Intelligence"},{"doi-asserted-by":"crossref","unstructured":"L. Naish. Specification = Program + Types. In Proc. Foundations of Software Technology and Theoretical Computer Science, pp. 326\u2013339. Springer LNCS 287, 1987.","key":"13_CR20","DOI":"10.1007\/3-540-18625-5_58"},{"doi-asserted-by":"crossref","unstructured":"A. Poign\u00e9. On Specifications, Theories, and Models with Higher Types. Information and Control, Vol. 68, No. 1\u20133, 1986.","key":"13_CR21","DOI":"10.1016\/S0019-9958(86)80027-4"},{"key":"13_CR22","first-page":"408","volume":"19","author":"J.C. Reynolds","year":"1974","unstructured":"J.C. Reynolds. Towards a Theory of Type Structure. In Proc. Colloque sur la Programmation, pp. 408\u2013425. Springer LNCS 19, 1974.","journal-title":"Proc. Colloque sur la Programmation"},{"issue":"1","key":"13_CR23","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"J.A. Robinson. A Machine-Oriented Logic Based on the Resolution Principle. Journal of the ACM, Vol. 12, No. 1, pp. 23\u201341, 1965.","journal-title":"Journal of the ACM"},{"unstructured":"G. Smolka. Order-Sorted Horn Logic: Semantics and Deduction. SEKI Report SR-86-17, FB Informatik, Univ. Kaiserslautern, 1986.","key":"13_CR24"},{"doi-asserted-by":"crossref","unstructured":"G. Smolka. Logic Programming over Polymorphically Order-Sorted Types. Dissertation, FB Informatik, Univ. Kaiserslautern, 1989.","key":"13_CR25","DOI":"10.1007\/3-540-50667-5_58"},{"key":"13_CR26","first-page":"297","volume-title":"Resolution of Equations in Algebraic Structures, Volume 2, Rewriting Techniques, chapter 10","author":"G. Smolka","year":"1989","unstructured":"G. Smolka, W. Nutt, J.A. Goguen, and J. Meseguer. Order-Sorted Equational Computation. In Hassan A\u00eft-Kaci and Maurice Nivat, editors, Resolution of Equations in Algebraic Structures, Volume 2, Rewriting Techniques, chapter 10, pp. 297\u2013367. Academic Press, New York, 1989."},{"unstructured":"M. Schmidt-Schauss. A Many Sorted Calculus with Polymorphic Functions Based on Resolution and Paramodulation. In Proc. 9th IJCAI. W. Kaufmann, 1985.","key":"13_CR27"},{"unstructured":"L. Sterling and E. Shapiro. The Art of Prolog. MIT Press, 1986.","key":"13_CR28"},{"key":"13_CR29","first-page":"441","volume":"10","author":"D.H.D. Warren","year":"1982","unstructured":"D.H.D. Warren. Higher-order extensions to PROLOG: are they needed? In Machine Intelligence 10, pp. 441\u2013454, 1982.","journal-title":"Machine Intelligence"},{"unstructured":"J. Xu and D.S. Warren. A Type Inference System For Prolog. In Proc. 5th Conference on Logic Programming & 5th Symposium on Logic Programming (Seattle), pp. 604\u2013619, 1988.","key":"13_CR30"},{"unstructured":"J. Zobel. Derivation of Polymorphic Types for Prolog Programs. In Proc. Fourth International Conference on Logic Programming (Melbourne), pp. 817\u2013838. MIT Press, 1987.","key":"13_CR31"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3540539816_67.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:51:39Z","timestamp":1605628299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3540539816_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540539810","9783540464990"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3540539816_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}