{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:18:00Z","timestamp":1770283080043,"version":"3.49.0"},"reference-count":29,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"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":5737,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,11]]},"DOI":"10.1016\/s0304-3975(97)00062-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:48:18Z","timestamp":1027644498000},"page":"147-165","source":"Crossref","is-referenced-by-count":43,"title":["Indexed types"],"prefix":"10.1016","volume":"187","author":[{"given":"Christoph","family":"Zenger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00062-5_BIB1","series-title":"Recent Trends in Multidimensional Systems Theory","first-page":"184","article-title":"Gr\u00f6bner Bases: An algorithmic method in polynomial ideal theory","author":"Buchberger","year":"1985"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB2","series-title":"Introduction to Functional Programming","author":"Bird","year":"1988"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB3","series-title":"Gr\u00f6bner Bases","author":"Becker","year":"1993"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB4","series-title":"Implementing Mathematics with the Nuprl Proof Development System","author":"Constable","year":"1986"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB5","author":"Cornes","year":"1995"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB6","series-title":"Ideals, Varieties, and Algorithms","author":"Cox","year":"1992"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB7","series-title":"2nd GI Conf. on Automata Theory and Formal Languages","article-title":"Quantifier elimination for real closed fields by cylindric algebraic decomposition","volume":"vol. 33","author":"Collins","year":"1975"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB8","series-title":"An algorithm for type-checking dependent types","author":"Coquand","year":"1996"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB9","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1145\/6041.6042","article-title":"On understanding types, data abstraction, and polymorphism","volume":"17","author":"Cardelli","year":"1985","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB10","series-title":"Proc. 9th POPL","first-page":"207","article-title":"Principal type-schemes for functional programs","author":"Damas","year":"1982"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB11","volume":"vol. 27","year":"1992"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB12","series-title":"ACM Symp. Principles of Programming Languages","article-title":"Proving the correctness of reactive systems using sized types","author":"Hughes","year":"1996"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB13","series-title":"An introduction to Gofer","author":"Jones","year":"1994"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511663086","article-title":"Qualified types: theory and practice","author":"Jones","year":"1994"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB15","series-title":"AXIOM","author":"Jenks","year":"1992"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB16","series-title":"Elements of Mathematical Logic","author":"Kreisel","year":"1967"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB17","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1145\/169701.169687","article-title":"Type reconstruction in the presence of polymorphic recursion","volume":"15","author":"Kfoury","year":"1993","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB18","doi-asserted-by":"crossref","DOI":"10.1145\/186025.186031","article-title":"Polymorphic type inference and abstract data types","author":"L\u00e4ufer","year":"1992"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB19","author":"Luo","year":"1992"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB20","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","article-title":"A theory of type polymorphism in programming","volume":"17","author":"Milner","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00062-5_BIB21","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0004-3702(84)90017-1","article-title":"A polymorphic type system for Prolog","volume":"23","author":"Mycroft","year":"1984","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB22","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1145\/44501.45065","article-title":"Abstract types have existential type","volume":"10","author":"Mitchell","year":"1988","journal-title":"ACM Trans. Programming Languages"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB23","series-title":"Proc. 23rd ACM Symp. Principles of Programming Languages","first-page":"65","article-title":"Putting type annotations to work","author":"Odersky","year":"1996"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB24","article-title":"The implementation of practical functional programming languages","author":"Perry","year":"1990"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB25","series-title":"Implementation of Functional Languages","year":"1990"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB26","article-title":"Typinferenz mit Constraints","author":"Sulzmann","year":"1996"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB27","series-title":"Functional Programming and Its Applications","article-title":"Recursion equations as a programming language","author":"Turner","year":"1982"},{"key":"10.1016\/S0304-3975(97)00062-5_BIB28","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","article-title":"Deforestation: Transforming programs to eliminate trees","volume":"73","author":"Wadler","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00062-5_BIB29","series-title":"Proc. 16th ACM Symp. Principles of Programming Languages","first-page":"60","article-title":"How to make ad-hoc polymorphism less ad-hoc","author":"Wadler","year":"1989"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000625?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000625?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:59:29Z","timestamp":1555419569000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597000625"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0304397597000625"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00062-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}