{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:49:21Z","timestamp":1725558561940},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141270"},{"type":"electronic","value":"9783642141287"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14128-7_21","type":"book-chapter","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T10:45:36Z","timestamp":1277808336000},"page":"247-261","source":"Crossref","is-referenced-by-count":1,"title":["A Unified Formal Description of Arithmetic and Set Theoretical Data Types"],"prefix":"10.1007","author":[{"given":"Paul","family":"Tarau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"21_CR1","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1305\/ndjfl\/1193667707","volume":"48","author":"R. Kaye","year":"2007","unstructured":"Kaye, R., Wong, T.L.: On Interpretations of Arithmetic and Set Theory. Notre Dame J. Formal Logic\u00a048(4), 497\u2013510 (2007)","journal-title":"Notre Dame J. Formal Logic"},{"key":"21_CR2","unstructured":"Jones, S.P., Jones, M., Meijer, E.: Type classes: An exploration of the design space. In: Haskell Workshop (1997)"},{"issue":"2","key":"21_CR3","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1215\/00294527-2009-003","volume":"50","author":"R. Pettigrew","year":"2009","unstructured":"Pettigrew, R.: On Interpretations of Bounded Arithmetic and Bounded Set Theory. Notre Dame J. Formal Logic\u00a050(2), 141\u2013151 (2009)","journal-title":"Notre Dame J. Formal Logic"},{"key":"21_CR4","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-02614-0_17","volume-title":"Intelligent Computer Mathematics","author":"P. Tarau","year":"2009","unstructured":"Tarau, P.: A Groupoid of Isomorphic Data Transformations. In: Carette, J., Dixon, L., Coen, C.S., Watt, S.M. (eds.) Calculemus 2009, MKM 2009. LNCS (LNAI), vol.\u00a05625, pp. 170\u2013185. Springer, Heidelberg (2009)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Tarau, P.: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell. In: Proceedings of ACM SAC 2009, Honolulu, Hawaii, pp. 1898\u20131903. ACM, New York (March 2009)","DOI":"10.1145\/1529282.1529706"},{"key":"21_CR6","first-page":"171","volume-title":"Proceedings of 11th International ACM SIGPLAN Symposium PPDP 2009","author":"P. Tarau","year":"2009","unstructured":"Tarau, P.: An Embedded Declarative Data Transformation Language. In: Proceedings of 11th International ACM SIGPLAN Symposium PPDP 2009, Coimbra, Portugal, pp. 171\u2013182. ACM Press, New York (September 2009)"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1002\/malq.200610026","volume":"53","author":"L. Kirby","year":"2007","unstructured":"Kirby, L.: Addition and multiplication of sets. Math. Log. Q.\u00a053(1), 52\u201365 (2007)","journal-title":"Math. Log. Q."},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","first-page":"733","volume-title":"Verification: Theory and Practice","author":"J. Vuillemin","year":"2004","unstructured":"Vuillemin, J.: Digital algebra and circuits. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol.\u00a02772, pp. 733\u2013746. Springer, Heidelberg (2004)"},{"issue":"2\/3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0890-5401(88)90005-3","volume":"76","author":"T. Coquand","year":"1988","unstructured":"Coquand, T., Huet, G.: The calculus of constructions. Information and Computation\u00a076(2\/3), 95\u2013120 (1988)","journal-title":"Information and Computation"},{"key":"21_CR10","unstructured":"The Coq development team: The Coq proof assistant reference manual. LogiCal Project, Version 8.0 (2004)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14128-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:22:51Z","timestamp":1558293771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14128-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141270","9783642141287"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14128-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}