{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T20:23:50Z","timestamp":1764361430846,"version":"3.46.0"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031997501"},{"type":"electronic","value":"9783031997518"}],"license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-031-99751-8_17","type":"book-chapter","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T01:20:02Z","timestamp":1759281602000},"page":"392-405","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Correctness of\u00a0Barron and\u00a0Strachey\u2019s Cartesian Product Function"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0295-7944","authenticated-orcid":false,"given":"Wouter","family":"Swierstra","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5405-2936","authenticated-orcid":false,"given":"Jason","family":"Hemann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,1]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Barron, D.W., Strachey, C.: Programming. In: Fox, L. (ed.) Advances in Programming and Non-Numerical Computation, pp. 49\u201382. Pergammon Press (1966)","DOI":"10.1016\/B978-0-08-011356-2.50006-9"},{"key":"17_CR2","unstructured":"de\u00a0Bruijn, N.G.: Automath: a language for mathematics. EUT report 68-WSK-05, Technische Hogeschool Eindhoven (1968). https:\/\/pure.tue.nl\/ws\/portalfiles\/portal\/2039924\/256169.pdf. wSK, Dept. of Mathematics and Computing Science"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-32347-8_11","volume-title":"Interactive Theorem Proving","author":"NA Danielsson","year":"2012","unstructured":"Danielsson, N.A.: Bag equivalence via a proof-relevant membership relation. In: Beringer, L., Felty, A. (eds.) ITP 2012. LNCS, vol. 7406, pp. 149\u2013165. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32347-8_11"},{"key":"17_CR4","doi-asserted-by":"publisher","unstructured":"Danvy, O., Spivey, M.: On Barron and Strachey\u2019s cartesian product function. In: Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming, ICFP 2007, pp. 41\u201346. Association for Computing Machinery (2007). https:\/\/doi.org\/10.1145\/1291151.1291161","DOI":"10.1145\/1291151.1291161"},{"key":"17_CR5","doi-asserted-by":"publisher","unstructured":"Dinges, A., Hinze, R.: What\u2019s in a bag?: an \u201capplication proving interface\u201d for finite bags and its implementation. In: Proceedings of the 35th Symposium on Implementation and Application of Functional Languages. IFL 2023. Association for Computing Machinery, New York (2024). https:\/\/doi.org\/10.1145\/3652561.3652563","DOI":"10.1145\/3652561.3652563"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"McBride, C.: Elimination with a motive. In: International Workshop on Types for Proofs and Programs, pp. 197\u2013216. Springer (2000)","DOI":"10.1007\/3-540-45842-5_13"},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1017\/S0956796803004829","volume":"14","author":"C McBride","year":"2004","unstructured":"McBride, C., McKinna, J.: The view from the left. J. Funct. Program. 14(1), 69\u2013111 (2004)","journal-title":"J. Funct. Program."},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Nederpelt, R.P., Geuvers, J.H., de Vrijer, R.C.: Selected Papers on Automath. Studies in Logic and the Foundations of Mathematics. Elsevier, Netherlands (1994). https:\/\/doi.org\/10.1016\/s0049-237x(08)70226-x","DOI":"10.1016\/s0049-237x(08)70226-x"},{"key":"17_CR9","unstructured":"Norell, U.: Towards a practical programming language based on dependent type theory. Ph.D. thesis, Department of Computer Science and Engineering, Chalmers University of Technology, SE-412 96 G\u00f6teborg, Sweden (2007)"},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Swierstra, W., Hemann, J.: Proofs associated with the paper \u2018On the Correctness of Barron and Strachey\u2019s Cartesian Product Function\u2019 (2025). https:\/\/doi.org\/10.5281\/zenodo.15118185","DOI":"10.5281\/zenodo.15118185"}],"container-title":["Lecture Notes in Computer Science","Trends in Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-99751-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T20:22:10Z","timestamp":1764361330000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-99751-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"ISBN":["9783031997501","9783031997518"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-99751-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,1]]},"assertion":[{"value":"1 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"TFP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Trends in Functional Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tfp2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/trendsfp.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}