{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T19:54:53Z","timestamp":1649102093698},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Stud Logica"],"published-print":{"date-parts":[[1989,9]]},"DOI":"10.1007\/bf00370827","type":"journal-article","created":{"date-parts":[[2004,11,3]],"date-time":"2004-11-03T00:23:01Z","timestamp":1099441381000},"page":"299-317","source":"Crossref","is-referenced-by-count":1,"title":["Categorical and algebraic aspects of Martin-L\u00f6f Type Theory"],"prefix":"10.1007","volume":"48","author":[{"given":"Adam","family":"Obtu\u0142owicz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF00370827_CR1","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0003-4843(82)90003-1","volume":"23","author":"M. Beeson","year":"1982","unstructured":"M. Beeson, Recursive models for constructive set theory, Annals of Mathematical Logic 23 (1982), pp. 127\u2013178.","journal-title":"Annals of Mathematical Logic"},{"key":"BF00370827_CR2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0168-0072(86)90053-9","volume":"32","author":"J. Cartmell","year":"1986","unstructured":"J. Cartmell, Generalized algebraic theories and contextual categories, Annals of Pure and Applied Logic 32 (1986), pp. 209\u2013243.","journal-title":"Annals of Pure and Applied Logic"},{"key":"BF00370827_CR3","volume-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"J. Diller","year":"1980","unstructured":"J. Diller, Modified realization and the formulae-as-types notion, in To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, J. P. Seldin and J. R. Hindley (eds.), Academic Press, London, 1980."},{"key":"BF00370827_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0004972700044828","volume":"7","author":"P. Freyd","year":"1972","unstructured":"P. Freyd, Aspects of Topoi, Bulletin of the Australian Mathematical Society 7 (1972), pp. 1\u201376.","journal-title":"Bulletin of the Australian Mathematical Society"},{"key":"BF00370827_CR5","unstructured":"G. Huet, Formal structure for computation and deduction, Notes for graduate-level course given in the Computer Science Department, Carnegie-Mellon University during the Spring 1986."},{"key":"BF00370827_CR6","volume-title":"Introduction to Higher Order Categorial Logic","author":"J. Lambek","year":"1986","unstructured":"J. Lambek and P.J. Scott, Introduction to Higher Order Categorial Logic, Cambridge University Press, Cambridge, 1986."},{"key":"BF00370827_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-9839-7","volume-title":"Categories for the Working Mathematician","author":"S. Mac Lane","year":"1971","unstructured":"S. Mac Lane, Categories for the Working Mathematician, Springer Verlag, New York, 1971."},{"key":"BF00370827_CR8","first-page":"153","volume-title":"Logic, M\u00e9thodology and Philosophy of Science VI","author":"P. Martin-L\u00f6f","year":"1982","unstructured":"P. Martin-L\u00f6f, Constructive mathematics and computer programming, in Logic, M\u00e9thodology and Philosophy of Science VI, L. J. Cohen, et. al. (eds.), North-Holland, Amsterdam, 1982, pp. 153\u2013175."},{"key":"BF00370827_CR9","doi-asserted-by":"crossref","unstructured":"R. Pare and D. Schumacher, Abstract families and the adjoint functor theorems, in Indexed Categories and Their Applications, Lecture Notes in Mathematics Vol. 661, 1978, pp. 1\u2013124.","DOI":"10.1007\/BFb0061361"},{"key":"BF00370827_CR10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1017\/S0305004100061284","volume":"95","author":"R. A. G. Seely","year":"1984","unstructured":"R. A. G. Seely, Locally cartesian closed categories and type theory, Mathematical Proceedings of C\u00e0mbridge Philosophical Society 95 (1984), pp. 33\u201348.","journal-title":"Mathematical Proceedings of C\u00e0mbridge Philosophical Society"},{"issue":"no. 1","key":"BF00370827_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90047-8","volume":"51","author":"A. Troelstra","year":"1987","unstructured":"A. Troelstra, On the syntax of Martin-L\u00f6f theories, Theoretical Computer Science 51, no. 1, 2 (1987), pp. 1\u201326.","journal-title":"Theoretical Computer Science"},{"key":"BF00370827_CR12","unstructured":"P. Taylor, Recursive domains, indexed category theory and polymorphism, Dissertation, Cambridge University, 1986."}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00370827.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00370827\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00370827","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T01:44:17Z","timestamp":1554774257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00370827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["BF00370827"],"URL":"https:\/\/doi.org\/10.1007\/bf00370827","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"value":"0039-3215","type":"print"},{"value":"1572-8730","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,9]]}}}