{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:38:47Z","timestamp":1725525527991},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540926863"},{"type":"electronic","value":"9783540926870"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92687-0_25","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T04:25:38Z","timestamp":1234239938000},"page":"365-379","source":"Crossref","is-referenced-by-count":0,"title":["Unifying Sets and Programs via Dependent Types"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Moczyd\u0142owski","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","volume-title":"Introduction to HOL: A Theorem Proving Environment for Higher-Order Logic","author":"M. Gordon","year":"1993","unstructured":"Gordon, M., Melham, T.: Introduction to HOL: A Theorem Proving Environment for Higher-Order Logic. Cambridge University Press, Cambridge (1993)"},{"key":"25_CR2","series-title":"Series F: Computer and Systems Sciences","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-59048-1_4","volume-title":"Logic of Computation","author":"R.L. Constable","year":"1997","unstructured":"Constable, R.L.: The structure of Nuprl\u2019s type theory. In: Logic of Computation. Series F: Computer and Systems Sciences, vol.\u00a0157, pp. 123\u2013156. Springer, Heidelberg (1997)"},{"key":"25_CR3","unstructured":"The Coq Development Team: The Coq Proof Assistant Reference Manual \u2013 Version V8.0 (2004)"},{"key":"25_CR4","first-page":"41","volume-title":"Automated Deduction","author":"H. Benl","year":"1998","unstructured":"Benl, H., Berger, U., Schwichtenberg, H., et al.: Proof theory at work: Program development in the Minlog system. In: Bibel, W., Schmitt, P.G. (eds.) Automated Deduction, vol.\u00a0II, pp. 41\u201371. Kluwer, Dordrecht (1998)"},{"key":"25_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624162","volume-title":"The B-book: assigning programs to meanings","author":"J.R. Abrial","year":"1996","unstructured":"Abrial, J.R.: The B-book: assigning programs to meanings. Cambridge University Press, New York (1996)"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/11814771_16","volume-title":"Automated Reasoning","author":"R. Constable","year":"2006","unstructured":"Constable, R., Moczyd\u0142owski, W.: Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS, vol.\u00a04130, pp. 162\u2013176. Springer, Heidelberg (2006)"},{"key":"25_CR7","unstructured":"Moczyd\u0142owski, W.: Investigations on Sets and Types. Ph.D thesis, Cornell University (2007)"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/BFb0066775","volume-title":"Cambridge Summer School in Mathematical Logic","author":"J. Myhill","year":"1973","unstructured":"Myhill, J.: Some properties of intuitionistic Zermelo-Fraenkel set theory. In: Cambridge Summer School in Mathematical Logic, vol.\u00a029, pp. 206\u2013231. Springer, Heidelberg (1973)"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Moczyd\u0142owski, W.: A Normalizing Intuitionistic Set Theory with Inaccessible Sets. Logical Methods in Computer Science\u00a03 (2007)","DOI":"10.2168\/LMCS-3(3:6)2007"},{"key":"25_CR10","unstructured":"McCarty, D.: Realizability and Recursive Mathematics. D.Phil. Thesis, University of Oxford (1984)"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/11874683_34","volume-title":"Computer Science Logic","author":"W. Moczyd\u0142owski","year":"2006","unstructured":"Moczyd\u0142owski, W.: Normalization of IZF with Replacement. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 516\u2013530. Springer, Heidelberg (2006)"},{"key":"25_CR12","volume-title":"Types and Programming Languages","author":"B.C. Pierce","year":"2002","unstructured":"Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)"},{"key":"25_CR13","volume-title":"Lectures on the Curry-Howard Isomorphism","author":"M. S\u00f8rensen","year":"2006","unstructured":"S\u00f8rensen, M., Urzyczyn, P.: Lectures on the Curry-Howard Isomorphism. Elsevier, Amsterdam (2006)"},{"key":"25_CR14","first-page":"23","volume-title":"Proceedings of LICS 2007","author":"W. Moczyd\u0142owski","year":"2007","unstructured":"Moczyd\u0142owski, W.: A Dependent Set Theory. In: Proceedings of LICS 2007, pp. 23\u201334. IEEE Computer Society Press, Los Alamitos (2007)"},{"key":"25_CR15","unstructured":"Aczel, P., Rathjen, M.: Notes on constructive set theory. Technical Report\u00a040, Institut Mittag-Leffler (The Royal Swedish Academy of Sciences) (2000\/2001)"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.entcs.2006.09.012","volume":"167","author":"R.S. Lubarsky","year":"2007","unstructured":"Lubarsky, R.S.: On the Cauchy Completeness of the Constructive Cauchy Reals. Electron. Notes Theor. Comput. Sci.\u00a0167, 225\u2013254 (2007)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/BFb0061823","volume-title":"Applications of Sheaves","author":"M.P. Fourman","year":"1979","unstructured":"Fourman, M.P., Hyland, J.: Sheaf models for analysis. In: Applications of Sheaves, pp. 280\u2013301. Springer, Heidelberg (1979)"},{"key":"25_CR18","unstructured":"Pollack, R.: The Theory of LEGO:A Proof Checker for the Extended Calculus of Constructions. Ph.D thesis, Department of Computer Science, University of Edinburgh (1995)"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-57887-0_89","volume-title":"Theoretical Aspects of Computer Software","author":"D.J. Howe","year":"1994","unstructured":"Howe, D.J., Stoller, S.D.: An Operational Approach to Combining Classical Set Theory and Functional Programming Languages. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol.\u00a0789, pp. 36\u201355. Springer, Heidelberg (1994)"},{"issue":"1","key":"25_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(92)90296-R","volume":"102","author":"K. Grue","year":"1992","unstructured":"Grue, K.: Map theory. Theor. Comput. Sci.\u00a0102(1), 1\u2013133 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR21","first-page":"55","volume-title":"Logic Colloquium 1977","author":"P. Aczel","year":"1978","unstructured":"Aczel, P.: The type theoretic interpretation of constructive set theory. In: Logic Colloquium 1977, pp. 55\u201366. North Holland, Amsterdam (1978)"},{"key":"#cr-split#-25_CR22.1","unstructured":"Dowek, G., Miquel, A.: Cut elimination for Zermelo\u2019s set theory (2006);"},{"key":"#cr-split#-25_CR22.2","unstructured":"Manuscript, available from the web pages of the authors"},{"key":"25_CR23","unstructured":"Shirahata, M.: Linear Set Theory. Ph.D thesis, Stanford University (1994)"},{"issue":"1","key":"25_CR24","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/B:STUD.0000034183.33333.6f","volume":"77","author":"K. Terui","year":"2004","unstructured":"Terui, K.: Light affine set theory: A naive set theory of polynomial time. Studia Logica\u00a077(1), 9\u201340 (2004)","journal-title":"Studia Logica"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92687-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T03:46:09Z","timestamp":1551757569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92687-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540926863","9783540926870"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92687-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}