{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:40:03Z","timestamp":1743133203836,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030524814"},{"type":"electronic","value":"9783030524821"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-52482-1_8","type":"book-chapter","created":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T16:03:46Z","timestamp":1594224226000},"page":"144-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Toward a Curry-Howard Equivalence for Linear, Reversible Computation"],"prefix":"10.1007","author":[{"given":"Kostia","family":"Chardonnet","sequence":"first","affiliation":[]},{"given":"Alexis","family":"Saurin","sequence":"additional","affiliation":[]},{"given":"Beno\u00eet","family":"Valiron","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,9]]},"reference":[{"key":"8_CR1","unstructured":"Baelde, D., Doumane, A., Saurin, A.: Infinitary proof theory: the multiplicative additive case. In: Proceedings of CSL. LIPIcs, vol. 62, pp. 42:1\u201342:17 (2016)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-75560-9_9","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D Baelde","year":"2007","unstructured":"Baelde, D., Miller, D.: Least and Greatest Fixed Points in Linear Logic. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 92\u2013106. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-75560-9_9"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Development - Coq\u2019Art. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-662-07964-5","DOI":"10.1007\/978-3-662-07964-5"},{"issue":"11","key":"8_CR4","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1073\/pnas.20.11.584","volume":"20","author":"HB Curry","year":"1934","unstructured":"Curry, H.B.: Functionality in combinatory logic. Proc. Nat. Acad. Sci. U.S.A. 20(11), 584 (1934)","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"issue":"12","key":"8_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0208561","volume":"13","author":"M Fingerhuth","year":"2018","unstructured":"Fingerhuth, M., Babej, T., Wittek, P.: Open source software in quantum computing. PLoS ONE 13(12), 1\u201328 (2018). \nhttps:\/\/doi.org\/10.1371\/journal.pone.0208561","journal-title":"PLoS ONE"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Gaboardi, M., Haeberlen, et al.: Linear dependent types for differential privacy. In: Proceedings of POPL, pp. 357\u2013370. ACM (2013). \nhttps:\/\/doi.org\/10.1145\/2429069.2429113","DOI":"10.1145\/2429069.2429113"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"JY Girard","year":"1987","unstructured":"Girard, J.Y.: Linear logic. Theoret. Comput. Sci. 50(1), 1\u2013101 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR8","first-page":"479","volume":"44","author":"WA Howard","year":"1980","unstructured":"Howard, W.A.: The formulae-as-types notion of construction. To HB Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism 44, 479\u2013490 (1980)","journal-title":"To HB Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Jung, R., Jourdan, et al.: RustBelt: securing the foundations of the Rust programming language. PACMPL 2(POPL), 66:1\u201366:34 (2018). \nhttps:\/\/doi.org\/10.1145\/3158154","DOI":"10.1145\/3158154"},{"issue":"7","key":"8_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1538788.1538814","volume":"52","author":"X Leroy","year":"2009","unstructured":"Leroy, X.: Formal verification of a realistic compiler. Commun. ACM 52(7), 107\u2013115 (2009). \nhttps:\/\/doi.org\/10.1145\/1538788.1538814","journal-title":"Commun. ACM"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Maillard, K., Hritcu, C., Rivas, E., Muylder, A.V.: The next 700 relational program logics. PACMPL 4(POPL), 4:1\u20134:33 (2020). \nhttps:\/\/doi.org\/10.1145\/3371072","DOI":"10.1145\/3371072"},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Paykin, J., Rand, R., Zdancewic, S.: QWIRE: a core language for quantum circuits. In: Proceedings of POPL, pp. 846\u2013858. ACM (2017). \nhttps:\/\/doi.org\/10.1145\/3009837.3009894","DOI":"10.1145\/3009837.3009894"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Reynolds, J.C.: Separation logic: a logic for shared mutable data structures. In: Proceedings of LICS, pp. 55\u201374. IEEE Computer Society (2002). \nhttps:\/\/doi.org\/10.1109\/LICS.2002.1029817","DOI":"10.1109\/LICS.2002.1029817"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"164","DOI":"10.4204\/EPTCS.266.11","volume":"266","author":"F Rios","year":"2017","unstructured":"Rios, F., Selinger, P.: A categorical model for a quantum circuit description language. Proceedings of QPL. ENTCS 266, 164\u2013178 (2017). \nhttps:\/\/doi.org\/10.4204\/EPTCS.266.11","journal-title":"Proceedings of QPL. ENTCS"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-319-89366-2_19","volume-title":"Foundations of Software Science and Computation Structures","author":"A Sabry","year":"2018","unstructured":"Sabry, A., Valiron, B., Vizzotto, J.K.: From Symmetric Pattern-Matching to Quantum Control. In: Baier, C., Dal Lago, U. (eds.) FoSSaCS 2018. LNCS, vol. 10803, pp. 348\u2013364. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-89366-2_19"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1017\/S0960129506005238","volume":"16","author":"P Selinger","year":"2006","unstructured":"Selinger, P., Valiron, B.: A lambda calculus for quantum computation with classical control. Math. Struct. Comput. Sci. 16(3), 527\u2013552 (2006)","journal-title":"Math. Struct. Comput. Sci."},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Swamy, N., Hritcu, C., Keller, C., et al.: Dependent types and multi-monadic effects in F. In: Proceedings of POPL, pp. 256\u2013270. ACM (2016). \nhttps:\/\/doi.org\/10.1145\/2837614.2837655","DOI":"10.1145\/2837614.2837655"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-52482-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T17:07:26Z","timestamp":1594228046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-52482-1_8"}},"subtitle":["Work-in-Progress"],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030524814","9783030524821"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-52482-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reversible Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oslo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.revcomp.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}