{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:47:48Z","timestamp":1749124068627},"reference-count":27,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"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":9725,"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":[[1986,12]]},"DOI":"10.1016\/s0747-7171(86)80002-5","type":"journal-article","created":{"date-parts":[[2008,3,29]],"date-time":"2008-03-29T10:14:04Z","timestamp":1206785644000},"page":"325-355","source":"Crossref","is-referenced-by-count":27,"title":["Constructing recursion operators in intuitionistic type theory"],"prefix":"10.1016","volume":"2","author":[{"given":"Lawrence C.","family":"Paulson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(86)80002-5_bib1","series-title":"The While-rule in Martin-L\u00f6f's Theory of Types","author":"Backhouse","year":"1985"},{"key":"10.1016\/S0747-7171(86)80002-5_bib2","series-title":"A Computational Logic","author":"Boyer","year":"1979"},{"key":"10.1016\/S0747-7171(86)80002-5_bib3","series-title":"Derivation of a Parsing Algorithm in Martin-L\u00f6f's Theory of Types","author":"Chisholm","year":"1985"},{"key":"10.1016\/S0747-7171(86)80002-5_bib4","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1090\/S0002-9904-1938-06720-1","article-title":"The constructive second number class","volume":"44","author":"Church","year":"1938","journal-title":"Bull. Amer, Math. Soc."},{"key":"10.1016\/S0747-7171(86)80002-5_bib5","series-title":"Foundations of Computation Theory","first-page":"64","article-title":"Constructive mathematics as a programming logic I: some principles of theory","author":"Constable","year":"1983"},{"key":"10.1016\/S0747-7171(86)80002-5_bib6","series-title":"Implementing Mathematics with the Nuprl Proof Development System","author":"Constable","year":"1986"},{"key":"10.1016\/S0747-7171(86)80002-5_bib7","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/359138.359142","article-title":"Proving termination with multiset orderings","volume":"22","author":"Dershowitz","year":"1979","journal-title":"Commun. ACM"},{"key":"10.1016\/S0747-7171(86)80002-5_bib8","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/3-540-15975-4_46","article-title":"Program verification in a logical theory of constructions","volume":"201","author":"Dybjer","year":"1985","journal-title":"In: (Jouannaud, J.P., ed.) Functional Programming Languages and Computer Architecture. Springer Lec. Notes Comp. Sci."},{"key":"10.1016\/S0747-7171(86)80002-5_bib9","series-title":"The Collected Papers of Gerhard Gentzen","first-page":"252","article-title":"New version of the consistency proof for elementary number theory","author":"Oentzen","year":"1938"},{"key":"10.1016\/S0747-7171(86)80002-5_bib10","series-title":"Edinburgh LCF: A Mechanised Logic of Computation","author":"Gordon","year":"1979"},{"key":"10.1016\/S0747-7171(86)80002-5_bib11","series-title":"Mathematical Theory of Computation","author":"Manna","year":"1974"},{"key":"10.1016\/S0747-7171(86)80002-5_bib12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0167-6423(81)90004-6","article-title":"Deductive synthesis of the unification algorithm","volume":"1","author":"Manna","year":"1981","journal-title":"Sci. Comp. Prog."},{"key":"10.1016\/S0747-7171(86)80002-5_bib13","series-title":"The Logical Basis for Computer Programming. Volume II: Deductive Techniques","author":"Manna","year":"1986"},{"key":"10.1016\/S0747-7171(86)80002-5_bib14","series-title":"Logic, Methodology, and Science 111","first-page":"153","article-title":"Constructive mathematics and computer programming","author":"Martin-L\u00f6f","year":"1982"},{"key":"10.1016\/S0747-7171(86)80002-5_bib15","series-title":"lntuitionistic Type Theory. Bibliopolis","author":"Martin-L\u00f6f","year":"1984"},{"key":"10.1016\/S0747-7171(86)80002-5_bib16","series-title":"ACM Conference on Functional Programming Languages and Computer Architecture","first-page":"141","article-title":"Programming in Constructive Set Theory: some examples","author":"Nordstr\u00f6m","year":"1981"},{"key":"10.1016\/S0747-7171(86)80002-5_bib17","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/BF02136027","article-title":"Propositions and specifications of programs in Martin-L\u00f6f's type theory","volume":"24","author":"Nordstr\u00f6m","year":"1984","journal-title":"BIT"},{"key":"10.1016\/S0747-7171(86)80002-5_bib18","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1093\/comjnl\/28.5.474","article-title":"Lessons learned from LCF: a survey of natural deduction proofs","volume":"28","author":"Paulson","year":"1985","journal-title":"Comput. J."},{"key":"10.1016\/S0747-7171(86)80002-5_bib19","doi-asserted-by":"crossref","DOI":"10.1016\/0743-1066(86)90015-4","article-title":"Natural deduction as higher-order resolution","author":"Paulson","year":"1986","journal-title":"J. Logic Prog."},{"key":"10.1016\/S0747-7171(86)80002-5_bib20","first-page":"63","article-title":"Proving termination of normalization functions for conditional expressions","volume":"2","author":"Paulson","year":"1986","journal-title":"9\". Automated Reasoning"},{"key":"10.1016\/S0747-7171(86)80002-5_bib21","series-title":"A Programming System for Type Theory. Report 21","author":"Petersson","year":"1982"},{"key":"10.1016\/S0747-7171(86)80002-5_bib22","series-title":"The Subset Type Former and the Type of Small Types in Martin-L\u00f6f's Theory of Types. Report 3","author":"Petersson","year":"1982"},{"key":"10.1016\/S0747-7171(86)80002-5_bib23","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/S0747-7171(86)80002-5_bib24","series-title":"Foundations of Computation Theory","first-page":"445","article-title":"The identification of propositions and types in Martin-L\u00f6f's Type Theory: a programming example","author":"Smith","year":"1983"},{"key":"10.1016\/S0747-7171(86)80002-5_bib25","doi-asserted-by":"crossref","first-page":"730","DOI":"10.2307\/2274128","article-title":"An interpretation of Martin-L\u00f6f's type theory in a type-free theory of propositions","volume":"49","author":"Smith","year":"1984","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0747-7171(86)80002-5_bib26","doi-asserted-by":"crossref","first-page":"155","DOI":"10.2307\/2270132","article-title":"Functionals defined by transfinite recursion","volume":"30","author":"Tait","year":"1965","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0747-7171(86)80002-5_bib27","doi-asserted-by":"crossref","first-page":"395","DOI":"10.2307\/2273149","article-title":"On definition trees of ordinal reeursive functionals: reduction of the reeurslon orders by means of type level raising","volume":"47","author":"Terlouw","year":"1982","journal-title":"J. Symbolic Logic"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717186800025?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717186800025?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T12:54:12Z","timestamp":1546174452000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717186800025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,12]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,12]]}},"alternative-id":["S0747717186800025"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(86)80002-5","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1986,12]]}}}