{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T14:22:13Z","timestamp":1648909333560},"reference-count":24,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8143,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1991,4]]},"DOI":"10.1016\/s0747-7171(08)80110-1","type":"journal-article","created":{"date-parts":[[2008,6,25]],"date-time":"2008-06-25T05:59:32Z","timestamp":1214373572000},"page":"349-368","source":"Crossref","is-referenced-by-count":5,"title":["A rewrite-based type discipline for a subset of computer algebra"],"prefix":"10.1016","volume":"11","author":[{"given":"H.","family":"Comon","sequence":"first","affiliation":[]},{"given":"D.","family":"Lugiez","sequence":"additional","affiliation":[]},{"given":"Ph.","family":"Schnoebelen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(08)80110-1_bib1","series-title":"Proc. ACM Symp. Symbolic and Algebraic Computation","article-title":"An object oriented approach to algebra system design","author":"Abdali","year":"1986"},{"key":"10.1016\/S0747-7171(08)80110-1_bib2","article-title":"Design and implementation of a generic, logic and functional programming language","volume":"213","author":"Bert","year":"1986"},{"key":"10.1016\/S0747-7171(08)80110-1_bib3","series-title":"Proc. 84 ACM Conf. Lisp and Functional Programming","article-title":"Compiling a functional language","author":"Cardelli","year":"1984"},{"issue":"4","key":"10.1016\/S0747-7171(08)80110-1_bib4","doi-asserted-by":"crossref","DOI":"10.1145\/6041.6042","article-title":"On understanding types, data abstraction and polymorphism","volume":"17","author":"Cardelli","year":"1985","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/S0747-7171(08)80110-1_bib5","series-title":"Lecture presented at EUROCAL'87","article-title":"Type inference in computer algebra","author":"Comon","year":"1987"},{"issue":"1","key":"10.1016\/S0747-7171(08)80110-1_bib6","doi-asserted-by":"crossref","DOI":"10.1016\/S0747-7171(85)80027-4","article-title":"Properties of substitutions and unifications","volume":"1","author":"Eder","year":"1985","journal-title":"J. Symbolic Computation"},{"key":"10.1016\/S0747-7171(08)80110-1_bib7","series-title":"An Overview of the Scratchpad II Language and System","author":"Fortenbacher","year":"1985"},{"key":"10.1016\/S0747-7171(08)80110-1_bib8","series-title":"Proc. 12th ACM Symp. Principles of Programming Languages","first-page":"52","article-title":"Principles of OBJ2","author":"Futatsugi","year":"1985"},{"key":"10.1016\/S0747-7171(08)80110-1_bib9","series-title":"Operational Semantics for Order-Sorted Algebra","author":"Goguen","year":"1984"},{"key":"10.1016\/S0747-7171(08)80110-1_bib10","article-title":"Models and equality for logical programming","volume":"250","author":"Goguen","year":"1987"},{"key":"10.1016\/S0747-7171(08)80110-1_bib11","series-title":"Order-Sorted Algebra I: Partial and Overloaded Operators, Errors and Inheritance","author":"Goguen","year":"1987"},{"key":"10.1016\/S0747-7171(08)80110-1_bib12","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-09724-4","article-title":"Edinburgh LCF. A mechanised logic of computation","volume":"78","author":"Gordon","year":"1979","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S0747-7171(08)80110-1_bib13","series-title":"REDUCE 3.1. User's Manual","author":"Hearn","year":"1984"},{"key":"10.1016\/S0747-7171(08)80110-1_bib14","series-title":"Formal Language Theory: Perspectives and Open Problems","first-page":"349","article-title":"Equations and rewrite rules: a survey","author":"Huet","year":"1980"},{"key":"10.1016\/S0747-7171(08)80110-1_bib15","first-page":"318","article-title":"Canonical forms and unification","volume":"87","author":"Hullot","year":"1980"},{"key":"10.1016\/S0747-7171(08)80110-1_bib16","series-title":"Lecture presented at EUROCAL'87","article-title":"On the design of the Scratchpad II interpreter","author":"Jenks","year":"1987"},{"key":"10.1016\/S0747-7171(08)80110-1_bib17","series-title":"The Macsyma Reference Manual","year":"1984"},{"key":"10.1016\/S0747-7171(08)80110-1_bib18","doi-asserted-by":"crossref","DOI":"10.1016\/0022-0000(78)90014-4","article-title":"A theory of type polymorphism programming","volume":"17","author":"Milner","year":"1978","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0747-7171(08)80110-1_bib19","series-title":"Lecture presented at Workshop on Unification","article-title":"Unification in an Order-Sorted Calculus with Declarations","author":"Schmidt-Schauss","year":"1987"},{"key":"10.1016\/S0747-7171(08)80110-1_bib20","series-title":"PhD thesis","article-title":"Computational Aspects of an Order-Sorted Logic with Term Declarations","author":"Schmidt-Schauss","year":"1988"},{"key":"10.1016\/S0747-7171(08)80110-1_bib21","series-title":"Proc. SIGPLAN 87 Symp. Interpreters and Interpretive Techniques","article-title":"The type inference and coercion facilities of the Scratchpad II interpreter","author":"Sutor","year":"1987"},{"key":"10.1016\/S0747-7171(08)80110-1_bib22","series-title":"A Semantics for Polymorphic Subtypes in Computer Algebra","author":"Schnoebelen","year":"1988"},{"key":"10.1016\/S0747-7171(08)80110-1_bib23","series-title":"PhD thesis","article-title":"Logic Programming over Polymorphically Order-Sorted Types","author":"Smolka","year":"1989"},{"key":"10.1016\/S0747-7171(08)80110-1_bib24","article-title":"An introduction to automated deduction","volume":"232","author":"Stickel","year":"1986"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717108801101?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717108801101?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,27]],"date-time":"2018-12-27T11:57:57Z","timestamp":1545911877000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717108801101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["S0747717108801101"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(08)80110-1","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}
