{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T03:12:09Z","timestamp":1775790729919,"version":"3.50.1"},"reference-count":46,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"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":5160,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1999,6]]},"DOI":"10.1016\/s0168-0072(98)00047-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:23:04Z","timestamp":1027642984000},"page":"111-156","source":"Crossref","is-referenced-by-count":85,"title":["Typability and type checking in System F are equivalent and undecidable"],"prefix":"10.1016","volume":"98","author":[{"given":"J.B.","family":"Wells","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0168-0072(98)00047-5_BIB1","series-title":"The Lambda Calculus: Its Syntax and Semantics","author":"Barendregt","year":"1984"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB2","first-page":"117","article-title":"Lambda calculi with types","volume":"vol. 2","author":"Barendregt","year":"1992"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB3","series-title":"26th Ann. Symp. on Foundations of Comput. Sci.","first-page":"339","article-title":"Partial polymorphic type inference is undecidable","author":"Boehm","year":"1985"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB4_1","series-title":"Formal Description of Programming Concepts","article-title":"Typeful programming","author":"Cardelli","year":"1991"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB4_2","unstructured":"Also DEC SRC Research Report 45."},{"key":"10.1016\/S0168-0072(98)00047-5_BIB5","article-title":"A strongly normalizable term having no type in the System F (second order \u03bb-calculus)","author":"Giannini","year":"1987"},{"issue":"1\/2","key":"10.1016\/S0168-0072(98)00047-5_BIB6","first-page":"87","article-title":"Type inference: Some results, some problems","volume":"19","author":"Giannini","year":"1993","journal-title":"Fund. Inform."},{"key":"10.1016\/S0168-0072(98)00047-5_BIB7","article-title":"Interpr\u00e9tation Fonctionnelle et Elimination des Coupures de l'Arithm\u00e9tique d'Ordre Sup\u00e9rieur","author":"Girard","year":"1972"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB8","article-title":"Proofs and Types","volume":"vol. 7","author":"Girard","year":"1989"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(81)90040-2","article-title":"Undecidability of the second-order unification problem","volume":"13","author":"Goldfarb","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0168-0072(98)00047-5_BIB10","series-title":"Proc. 3rd Ann. Symp. Logic in Computer Sci.","first-page":"61","article-title":"Characterization of typings in polymorphic type discipline","author":"Giannini","year":"1988"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB11","series-title":"Theoretical Aspects Comput. Softw.: Internat. Conf.","first-page":"18","article-title":"Type inference in polymorphic type discipline","volume":"vol. 526","author":"Giannini","year":"1991"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB12","series-title":"Conf. Rec. 18th Ann. ACM Symp. Principles of Programming Languages","first-page":"119","article-title":"The complexity of type inference for higher-order typed lambda calculi","author":"Henglein","year":"1991"},{"issue":"4","key":"10.1016\/S0168-0072(98)00047-5_BIB13","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1017\/S0956796800001143","article-title":"The complexity of type inference for higher-order typed lambda calculi","volume":"4","author":"Henglein","year":"1994","journal-title":"J. Funct. Prog."},{"key":"10.1016\/S0168-0072(98)00047-5_BIB14","article-title":"The principal type scheme of an object in combinatory logic","author":"Hindley","year":"1969","journal-title":"Trans. AMS"},{"issue":"2","key":"10.1016\/S0168-0072(98)00047-5_BIB15","doi-asserted-by":"crossref","first-page":"219","DOI":"10.2307\/2269811","article-title":"The undecidability of the Turing machine immortality problem","volume":"31","author":"Hooper","year":"1966","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB16","article-title":"Report on the functional programming language Haskell","author":"Hudak","year":"1988"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB17","series-title":"Type inference in System F plus subtyping","author":"Jim","year":"1995"},{"issue":"2","key":"10.1016\/S0168-0072(98)00047-5_BIB18","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0890-5401(92)90020-G","article-title":"Type reconstruction in finite-rank fragments of the second-order \u03bb-calculus","volume":"98","author":"Kfoury","year":"1992","journal-title":"Inform. and Comput."},{"issue":"1","key":"10.1016\/S0168-0072(98)00047-5_BIB19","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1006\/inco.1993.1003","article-title":"The undecidability of the semi-unification problem","volume":"102","author":"Kfoury","year":"1993","journal-title":"Inform and Comput."},{"key":"10.1016\/S0168-0072(98)00047-5_BIB20","series-title":"Proc. 1994 ACM Conf. on LISP Funct. Program","article-title":"A direct algorithm for type inference in the rank-2 fragment of the second-order \u03bb-calculus","author":"Kfoury","year":"1994"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB21","series-title":"Conf. Rec. 10th Ann. ACM Symp. on Principles of Programming Languages","first-page":"88","article-title":"Polymorphic type inference","author":"Leivant","year":"1983"},{"issue":"1","key":"10.1016\/S0168-0072(98)00047-5_BIB22","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0890-5401(91)90053-5","article-title":"Finitely stratified polymorphism","volume":"93","author":"Leivant","year":"1991","journal-title":"Inform and Comput."},{"key":"10.1016\/S0168-0072(98)00047-5_BIB23","series-title":"Proc. ACM Symp. LISP and Funct. Program","first-page":"243","article-title":"A semantic model of types for applicative languages","author":"MacQueen","year":"1982"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB24","series-title":"Semantics of Data Types: Int. Symp.","first-page":"301","article-title":"The typechecking of programs with implicit type structure","volume":"vol. 173","author":"McCracken","year":"1984"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB25","series-title":"The Definition of Standard ML","author":"Milner","year":"1990"},{"issue":"3","key":"10.1016\/S0168-0072(98)00047-5_BIB26","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","article-title":"Recursive unsolvability of Post's problem of \u2018tag\u2019 and other topics in the theory of Turing machines","volume":"74","author":"Minsky","year":"1961","journal-title":"Ann. Math."},{"issue":"2\/3","key":"10.1016\/S0168-0072(98)00047-5_BIB27","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0890-5401(88)90009-0","article-title":"Polymorphic type inference and containment","volume":"76","author":"Mitchell","year":"1988","journal-title":"Inform and Comput."},{"issue":"1\u20132","key":"10.1016\/S0168-0072(98)00047-5_BIB28","first-page":"185","article-title":"On the undecidability of partial polymorphic type reconstruction","volume":"19","author":"Pfenning","year":"1993","journal-title":"Fund. Inform."},{"key":"10.1016\/S0168-0072(98)00047-5_BIB29","series-title":"Proc. 3rd Int. Joint Conf. on Theory and Practice of Software Development","article-title":"LEAP: a language with eval and polymorphism","author":"Pfenning","year":"1989"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB30","series-title":"Stockholm Studies in Philosophy","article-title":"Natural Deduction; A Proof-Theoretical Study","author":"Prawitz","year":"1965"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB31","series-title":"Proc. 9th Ann. IEEE Symp. on Logic in Computer Science","year":"1994"},{"issue":"3","key":"10.1016\/S0168-0072(98)00047-5_BIB32","first-page":"551","article-title":"On a unification problem related to Kreisel's conjecture","volume":"29","author":"Pudl\u00e1k","year":"1988","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB33","series-title":"Symp. on Programming","first-page":"408","article-title":"Towards a theory of type structure","volume":"vol. 19","author":"Reynolds","year":"1974"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB34","series-title":"Conf. Rec. POPL '98: 25th ACM Symp. on Principles of Programming Languages","article-title":"Second-order unification and type inference for Church-style polymorphism","author":"Schubert","year":"1998"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB35","article-title":"The subtyping problem for second-order types is undecidable","author":"Tiuryn","year":"1995"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB36","series-title":"Proc. 11th Ann. IEEE Symp. on Logic in Computer Sci.","article-title":"The subtyping problem for second-order types is undecidable","author":"Tiuryn","year":"1996"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB37","series-title":"IFIP Int. Conf. Funct. Program. Comput. Arch.","article-title":"Miranda: a non-strict functional language with polymorphic types","volume":"vol. 201","author":"Turner","year":"1985"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB38","doi-asserted-by":"crossref","DOI":"10.1109\/LICS.1994.316059","article-title":"The emptiness problem for intersection types","author":"Urzyczyn","year":"1993"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB39","series-title":"Proc. Int. Conf. on Typed Lambda Calculi and Applications","first-page":"418","article-title":"Type reconstruction in F\u03c9 is undecidable","author":"Urzyczyn","year":"1993"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB40","series-title":"Proc. 9th Ann. IEEE Symp. on Logic in Computer Science","first-page":"300","article-title":"The emptiness problem for intersection types","author":"Urzyczyn","year":"1994"},{"issue":"4","key":"10.1016\/S0168-0072(98)00047-5_BIB41","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1017\/S0960129597002302","article-title":"Type reconstruction in F\u03c9","volume":"7","author":"Urzyczyn","year":"1997","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0168-0072(98)00047-5_BIB42","series-title":"Proc. 9th Ann. IEEE Symp. on Logic in Computer Science","article-title":"Typability and type checking in the second-order \u03bb-calculus are equivalent and undecidable","author":"Wells","year":"1994"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB43","article-title":"The undecidability of Mitchell's subtyping relation","author":"Wells","year":"1995"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB44","article-title":"Typability is undecidable for F + eta","author":"Wells","year":"1996"},{"key":"10.1016\/S0168-0072(98)00047-5_BIB45","article-title":"Type Inference for System F with and without the Eta Rule","author":"Wells","year":"1996"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007298000475?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007298000475?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T06:55:42Z","timestamp":1555052142000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0168007298000475"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":46,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0168007298000475"],"URL":"https:\/\/doi.org\/10.1016\/s0168-0072(98)00047-5","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}