{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:41:50Z","timestamp":1747546910983},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,2,1]],"date-time":"1989-02-01T00:00:00Z","timestamp":602294400000},"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":8932,"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":[[1989,2]]},"DOI":"10.1016\/0304-3975(89)90074-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"113-139","source":"Crossref","is-referenced-by-count":5,"title":["Generalization from partial parametrization in higher-order type theory"],"prefix":"10.1016","volume":"63","author":[{"given":"Masami","family":"Hagiya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90074-1_bib1","series-title":"The Lambda Calculus, Its syntax and Semantics","author":"Barendregt","year":"1984"},{"issue":"1","key":"10.1016\/0304-3975(89)90074-1_bib2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/2363.2528","article-title":"Proofs as programs","volume":"7","author":"Bates","year":"1985","journal-title":"ACM Toplas"},{"key":"10.1016\/0304-3975(89)90074-1_bib3","series-title":"Semantics of Data Types","first-page":"1","article-title":"A kernel language for abstract data types and modules","volume":"173","author":"Burstall","year":"1984"},{"key":"10.1016\/0304-3975(89)90074-1_bib4","series-title":"Tech. Rept.","article-title":"The higher-order polymorphic \u03bb-calculus","author":"Cardelli","year":"1985"},{"issue":"1","key":"10.1016\/0304-3975(89)90074-1_bib5","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/357233.357238","article-title":"The type theory of PL\/CV3","volume":"6","author":"Constable","year":"1984","journal-title":"ACM Toplas"},{"key":"10.1016\/0304-3975(89)90074-1_bib6","series-title":"Proc. EUROCAL '85: European Conf. on Computer Algebra","first-page":"151","article-title":"Constructions: a higher-order proof system for mechanizing mathematics","volume":"203","author":"Coquand","year":"1985"},{"key":"10.1016\/0304-3975(89)90074-1_bib7","series-title":"Essays in Combinatory Logic, Lambda Calculus and Formalism","first-page":"589","article-title":"A survey of the project AUTOMATH","author":"De Brujin","year":"1980"},{"issue":"3","key":"10.1016\/0304-3975(89)90074-1_bib8","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1145\/3916.3986","article-title":"Program abstraction and instantion","volume":"7","author":"Dershowitz","year":"1985","journal-title":"ACM Toplas"},{"key":"10.1016\/0304-3975(89)90074-1_bib9","series-title":"The Role of Language in Problem Solving 2","first-page":"95","article-title":"Analogy in program development","author":"Dietzen","year":"1986"},{"key":"10.1016\/0304-3975(89)90074-1_bib10","series-title":"Tech. Rept.","article-title":"An environment for formal systems","author":"Griffin","year":"1987"},{"key":"10.1016\/0304-3975(89)90074-1_bib11","first-page":"194","article-title":"A framework for defining logics","author":"Harper","year":"1987","journal-title":"Proc. Symp. on Logic in Computer Science 87"},{"key":"10.1016\/0304-3975(89)90074-1_bib12","series-title":"Essays in Combinatory Logic, Lambda, Calculus and Formalism","first-page":"479","article-title":"The formula-as-types notion of construction","author":"Howard","year":"1980"},{"key":"10.1016\/0304-3975(89)90074-1_bib13","series-title":"Program Specification and Transformation","first-page":"131","article-title":"Deriving and using destructive data types","author":"J\u00f8rring","year":"1986"},{"key":"10.1016\/0304-3975(89)90074-1_bib14","series-title":"Logic Colloquium III","first-page":"73","article-title":"An intuitionistic theory of types: predicative part","author":"Martin-L\u00f6f","year":"1973"},{"key":"10.1016\/0304-3975(89)90074-1_bib15","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\/0304-3975(89)90074-1_bib16","series-title":"Proc. 5th Conf. on Automated Deduction","first-page":"182","article-title":"An approach to theorem proving on the basis of a typed lambda-calculus","volume":"87","author":"Nederpelt","year":"1982"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900741?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900741?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:55:17Z","timestamp":1555113317000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589900741"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,2]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,2]]}},"alternative-id":["0304397589900741"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90074-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,2]]}}}