{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T14:34:16Z","timestamp":1648996456823},"reference-count":29,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":11156,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1983]]},"DOI":"10.1016\/s0019-9958(83)80033-3","type":"journal-article","created":{"date-parts":[[2005,5,3]],"date-time":"2005-05-03T07:12:14Z","timestamp":1115104334000},"page":"127-147","source":"Crossref","is-referenced-by-count":8,"title":["Semantics for classical AUTOMATH and related systems"],"prefix":"10.1016","volume":"59","author":[{"given":"Henk","family":"Barendregt","sequence":"first","affiliation":[]},{"given":"Adrian","family":"Rezus","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(83)80033-3_bib1","series-title":"Proceedings, Symp. Math. Logic","first-page":"1","article-title":"The strength of Martin-L\u00f6f's intuitionistic type theoy with one universe","author":"Aczel","year":"1977"},{"key":"10.1016\/S0019-9958(83)80033-3_bib2","series-title":"The Lambda Calculus, Its Syntax and Semantics","author":"Barendregt","year":"1981"},{"key":"10.1016\/S0019-9958(83)80033-3_bib3","unstructured":"Barendregt, H. P., Lambda calculus and its models, in \u201cLogic Colloquium '82\u201d (G. Lolli, G. Longo, and A. Marcja, Eds.), North-Holland, Amsterdam, in press."},{"key":"10.1016\/S0019-9958(83)80033-3_bib4_1","unstructured":"Beeson, M., \u201cFoundations of Constructive Mathematics: Metamathematical Studies,\u201d Springer-Verlag, Berlin\/Heidelberg\/New York, in press."},{"key":"10.1016\/S0019-9958(83)80033-3_bib4_2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0003-4843(82)90003-1","volume":"23","year":"1982","journal-title":"Ann. of Math. Logic"},{"key":"10.1016\/S0019-9958(83)80033-3_bib5","series-title":"To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism","first-page":"579","article-title":"A survey of the project AUTOMATH","author":"De Bruijn","year":"1980"},{"key":"10.1016\/S0019-9958(83)80033-3_bib6","article-title":"The Language Theory of AUTOMATH","author":"Van Daalen","year":"1980"},{"key":"10.1016\/S0019-9958(83)80033-3_bib7","series-title":"A Compendium of Continuous Lattices","author":"Gierz","year":"1980"},{"key":"10.1016\/S0019-9958(83)80033-3_bib8","article-title":"Interpretation fonctionelle et \u00e9limination des coupures de l'arithm\u00e9tique d'ordre sup\u00e9rieur","author":"Girard","year":"1972"},{"key":"10.1016\/S0019-9958(83)80033-3_bib9","series-title":"Introduction to Combinatory Logic","author":"Hindley","year":"1972"},{"key":"10.1016\/S0019-9958(83)80033-3_bib10","series-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","first-page":"479","article-title":"The formulae-as-types notion of construction","author":"Howard","year":"1980"},{"key":"10.1016\/S0019-9958(83)80033-3_bib11","article-title":"Checking Landau's \u201cGrundlagen\u201d in the AUTOMATH System","author":"Jutting","year":"1979"},{"key":"10.1016\/S0019-9958(83)80033-3_bib12_1","series-title":"Derived \u03bb-calculus models and the construction of D\u221e inside P\u03c9","author":"Koymans","year":"1983"},{"key":"10.1016\/S0019-9958(83)80033-3_bib12_2","series-title":"Models of the Lambda-Calculus","year":"1984"},{"key":"10.1016\/S0019-9958(83)80033-3_bib13","article-title":"Typed and untyped extensional \u03bb-calculus models in P\u03c9","author":"Laarhoven","year":"1975"},{"key":"10.1016\/S0019-9958(83)80033-3_bib14","article-title":"A Theory of Types","author":"Martin-L\u00f6f","year":"1971"},{"key":"10.1016\/S0019-9958(83)80033-3_bib15","article-title":"An Intuitionistic Theory of Types","author":"Martin-L\u00f6f","year":"1972"},{"key":"10.1016\/S0019-9958(83)80033-3_bib16","series-title":"Logic Colloquium '73","first-page":"73","article-title":"An intuitionistic theory of types: Predicative part","author":"Martin-L\u00f6f","year":"1973"},{"key":"10.1016\/S0019-9958(83)80033-3_bib17","series-title":"Logic, Methodology and Philosophy of Science VI","first-page":"153","article-title":"Constructive mathematics and computer programming","author":"Martin-L\u00f6f","year":"1982"},{"key":"10.1016\/S0019-9958(83)80033-3_bib18","series-title":"Logic for Computable Functions; Description of a Machine Implementation","author":"Milner","year":"1972"},{"key":"10.1016\/S0019-9958(83)80033-3_bib19","series-title":"Foundations of Computer Science II, Part 2","article-title":"Models for LCF","author":"Milner","year":"1976"},{"key":"10.1016\/S0019-9958(83)80033-3_bib20","series-title":"Proceedings, Programming Symposium","first-page":"408","article-title":"Towards a theory of type structure","author":"Reynolds","year":"1974"},{"key":"10.1016\/S0019-9958(83)80033-3_bib21","article-title":"Abstract AUTOMATH","author":"Rezus","year":"1983"},{"key":"10.1016\/S0019-9958(83)80033-3_bib22","series-title":"Toposes, Algebraic Geometry and Logic","first-page":"97","article-title":"Continuous lattices","author":"Scott","year":"1972"},{"key":"10.1016\/S0019-9958(83)80033-3_bib23","series-title":"Logic, Methodology and Philosophy of Science IV","first-page":"157","article-title":"Models for various type-free calculi","author":"Scott","year":"1973"},{"key":"10.1016\/S0019-9958(83)80033-3_bib24","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","article-title":"Data types as lattices","volume":"5","author":"Scott","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0019-9958(83)80033-3_bib25","series-title":"Kleene Symposium","first-page":"223","article-title":"Lambda-calculus: Some models, some philosophy","author":"Scott","year":"1980"},{"key":"10.1016\/S0019-9958(83)80033-3_bib26","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0003-4843(79)90020-2","article-title":"Progress report on generalized functionality","volume":"17","author":"Seldin","year":"1979","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/S0019-9958(83)80033-3_bib27","series-title":"Colloque International de Logique, Clermont Ferrand","first-page":"135","article-title":"Formalization of classical mathematics in AUTOMATH","author":"Zucker","year":"1975"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995883800333?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995883800333?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T14:55:59Z","timestamp":1548514559000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995883800333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":29,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1983]]}},"alternative-id":["S0019995883800333"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(83)80033-3","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}