{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:04Z","timestamp":1725664264616},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580850"},{"type":"electronic","value":"9783540484400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58085-9_74","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:11:36Z","timestamp":1330251096000},"page":"108-126","source":"Crossref","is-referenced-by-count":1,"title":["Logic of refinement types"],"prefix":"10.1007","author":[{"given":"Susumu","family":"Hayashi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"M.J. Beeson, Foundations of Constructive Mathematics, Springer-Verlag, 1985.","DOI":"10.1007\/978-3-642-68952-9"},{"key":"6_CR2","unstructured":"R.M. Burstall and J. H. McKinna, Deliverables: an approach to program in Constructions, Technical Report ECS-LFCS-91-133, Department of Computer Science, The University of Edinburgh, 1991."},{"key":"6_CR3","unstructured":"Dowek, C. et al., The Coq Proof Assistant User's Guide, Version 5.6, Technical Report No. 134, INRIA, December, 1991."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0890-5401(88)90005-3","volume":"76","author":"T. Coquand","year":"1988","unstructured":"Th. Coquand and G. Huet, Calculus of Constructions, Information and Computation, vol. 76, pp. 95\u2013120, 1988.","journal-title":"Information and Computation"},{"key":"6_CR5","volume-title":"Refinement Types for ML","author":"T. Freeman","year":"1991","unstructured":"T. Freeman and F. Pfenning, Refinement Types for ML, ACM SIGPLAN'91, Conference on Programming Language Design and Implementation, Toronto, Ontario, ACM Press, 1991."},{"key":"6_CR6","first-page":"77","volume":"XXVI","author":"S. Hayashi","year":"1977","unstructured":"S. Hayashi, On derived rules of intuitionistic second order arithmetic, Commentariorum Mathematicorum Universitatis Sancti Pauli, vol. XXVI, pp. 77\u2013103, 1977.","journal-title":"Commentariorum Mathematicorum Universitatis Sancti Pauli"},{"key":"6_CR7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(85)90062-3","volume":"41","author":"S. Hayashi","year":"1986","unstructured":"S. Hayashi, Adjunction of semifunctors: categorical structures in non-extensional lambda calculus, Theoretical Computer Sciences, vol. 41, pp.95\u2013104, 1986.","journal-title":"Theoretical Computer Sciences"},{"key":"6_CR8","unstructured":"S. Hayashi and H. Nakano, PX: A Computational Logic, The MIT Press, 1988."},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"S. Hayashi, Singleton, Union and Intersection Types for Program Extraction, Lecture Notes in Computer Science No. 526, pp. 701\u2013730, T.Ito and A.R.Meyer, eds., Springer-Verlag, 1991, an extended version to appear in Information and Computation.","DOI":"10.1007\/3-540-54415-1_71"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1017\/S096012950000013X","volume":"3","author":"R. Hoofman","year":"1993","unstructured":"R. Hoofman, The theory of semi-functors, Mathematical Structures in Computer Science, vol. 3, pp.93\u2013128, 1993.","journal-title":"Mathematical Structures in Computer Science"},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1017\/S0960129500001341","volume":"1","author":"B. Jacobs","year":"1991","unstructured":"B. Jacobs, Semantics of the second order lambda calculus, Mathematical Structures in Computer Science, vol. 1, pp. 327\u2013360, 1991.","journal-title":"Mathematical Structures in Computer Science"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Z. Luo. ECC, an Extended Calculus of Constructions, in Proceedings of the Fourth Annual IEEE Symposium on Logic in Computer Science, Asilomar, California, 1989.","DOI":"10.1109\/LICS.1989.39193"},{"key":"6_CR13","unstructured":"Z. Luo. An Extended Calculus of Constructions, Ph. D. thesis, Department of Computer Science, The University of Edinburgh, 1990."},{"key":"6_CR14","unstructured":"Z. Luo. A problem of adequacy: conservativity of Calculus of Constructions over higher order logic, Technical Report ECS-LFCS-90-121, Department of Computer Science, The University of Edinburgh, 1990."},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"M. Makkai and G. Reyes. First Order Categorical Logic, Lecture Note in Mathematics No. 611, 1977, Springer-Verlag.","DOI":"10.1007\/BFb0066201"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"J. H. McKinna. Deliverables: A Categorical Approach to Program Development in Type Theory, Ph. D. thesis, Department of Computer Science, The University of Edinburgh, 1992.","DOI":"10.1007\/3-540-57182-5_3"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":", H. Nakano. A Constructive Formalization of the Catch and Throw Mechanism, in Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, 1992.","DOI":"10.1109\/LICS.1992.185522"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"C. Paulin-Mohring and B. Werner, Synthesis of ML programs in the System Coq, Journal of Symbolic Computation, 1993.","DOI":"10.1016\/S0747-7171(06)80007-6"},{"key":"6_CR19","unstructured":"F. Pfenning, Intersection Types for a Logical Framework, in this volume, 1992."},{"key":"6_CR20","unstructured":"Erik Poll, A programming logic for F\u03c9, Computing Science Notes, 92\/25, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1992."},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"A.S. Troelstra, Metamathematical investigations of intuitionistic arithmetic and analysis, Lecture Notes in Mathematics, vol. 344, Springer-Verlag, 1973.","DOI":"10.1007\/BFb0066739"}],"container-title":["Lecture Notes in Computer Science","Types for Proofs and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58085-9_74.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:16:48Z","timestamp":1605629808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58085-9_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580850","9783540484400"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-58085-9_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}