{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T12:19:13Z","timestamp":1770293953449,"version":"3.49.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319994970","type":"print"},{"value":"9783319994987","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-99498-7_21","type":"book-chapter","created":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T08:45:39Z","timestamp":1534841139000},"page":"304-321","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["$$\\mathsf {CoreFun}$$: A Typed Functional Reversible Core Language"],"prefix":"10.1007","author":[{"given":"Petur Andrias H\u00f8jgaard","family":"Jacobsen","sequence":"first","affiliation":[]},{"given":"Robin","family":"Kaarsgaard","sequence":"additional","affiliation":[]},{"given":"Michael Kirkedal","family":"Thomsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,22]]},"reference":[{"key":"21_CR1","volume-title":"Entailment: The Logic of Relevance and Necessity","author":"AR Anderson","year":"1975","unstructured":"Anderson, A.R., Belnap, N.D.: Entailment: The Logic of Relevance and Necessity, vol. 1. Princeton University Press, Princeton (1975)"},{"issue":"5","key":"21_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s00236-015-0253-y","volume":"53","author":"HB Axelsen","year":"2016","unstructured":"Axelsen, H.B., Gl\u00fcck, R.: On reversible turing machines and their function universality. Acta Informatica 53(5), 509\u2013543 (2016)","journal-title":"Acta Informatica"},{"key":"21_CR3","doi-asserted-by":"publisher","unstructured":"Dunn, J.M., Restall, G.: Relevance logic. In: Gabbay, D., Guenther, F. (eds.) Handbook of Philosophical Logic, 2nd edn., vol. 6, pp. 1\u2013192. Springer, Dordrecht (2002). https:\/\/doi.org\/10.1007\/978-94-017-0460-1_1","DOI":"10.1007\/978-94-017-0460-1_1"},{"issue":"1","key":"21_CR4","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. Theor. Comput. Sci. 50(1), 1\u2013101 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Gl\u00fcck, R., Kaarsgaard, R.: A categorical foundation for structured reversible flowchart languages. In: Silva, A. (ed.) Mathematical Foundations of Programming Semantics (MFPS XXXIII). Electronic Notes in Theoretical Computer Science, vol. 336, pp. 155\u2013171. Elsevier (2018)","DOI":"10.1016\/j.entcs.2018.03.021"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Green, A.S., Lumsdaine, P.L., Ross, N.J., Selinger, P., Valiron, B.: Quipper: a scalable quantum programming language. In: Conference on Programming Language Design and Implementation, PLDI, PLDI 2013, pp. 333\u2013342. ACM (2013)","DOI":"10.1145\/2491956.2462177"},{"issue":"5","key":"21_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/TIT.1959.1057537","volume":"5","author":"DA Huffman","year":"1959","unstructured":"Huffman, D.A.: Canonical forms for information-lossless finite-state logical machines. IRE Trans. Inf. Theory 5(5), 41\u201359 (1959)","journal-title":"IRE Trans. Inf. Theory"},{"key":"21_CR8","unstructured":"James, R.P., Sabry, A.: Theseus: a high level language for reversible computing (2014), work in progress paper at RC 2014. www.cs.indiana.edu\/~sabry\/papers\/theseus.pdf"},{"issue":"3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1147\/rd.53.0183","volume":"5","author":"R Landauer","year":"1961","unstructured":"Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5(3), 183\u2013191 (1961)","journal-title":"IBM J. Res. Dev."},{"key":"21_CR10","first-page":"2597","volume":"257","author":"Y Lecerf","year":"1963","unstructured":"Lecerf, Y.: Machines de Turing r\u00e9versibles. Comptes Rendus Hebdomadaires des S\u00e9ances de l\u2019Acad\u00e9mie des Sciences 257, 2597\u20132600 (1963)","journal-title":"Comptes Rendus Hebdomadaires des S\u00e9ances de l\u2019Acad\u00e9mie des Sciences"},{"key":"21_CR11","unstructured":"Lutz, C., Derby, H.: Janus: a time-reversible language. A letter to R. Landauer (1986). http:\/\/tetsuo.jp\/ref\/janus.pdf"},{"key":"21_CR12","volume-title":"Types and Programming Languages","author":"BC Pierce","year":"2002","unstructured":"Pierce, B.C.: Types and Programming Languages, 1st edn. The MIT Press, Cambridge (2002)","edition":"1"},{"key":"21_CR13","volume-title":"Types and Programming Languages","author":"BC Pierce","year":"2002","unstructured":"Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)"},{"key":"21_CR14","unstructured":"Polakow, J.: Ordered Linear Logic and Applications. Ph.D. thesis. Carnegie Mellon University (2001)"},{"key":"21_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). https:\/\/doi.org\/10.1007\/978-3-319-89366-2_19"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-319-20860-2_6","volume-title":"Reversible Computation","author":"M Schordan","year":"2015","unstructured":"Schordan, M., Jefferson, D., Barnes, P., Oppelstrup, T., Quinlan, D.: Reverse code generation for parallel discrete event simulation. In: Krivine, J., Stefani, J.-B. (eds.) RC 2015. LNCS, vol. 9138, pp. 95\u2013110. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20860-2_6"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-319-20860-2_7","volume-title":"Reversible Computation","author":"UP Schultz","year":"2015","unstructured":"Schultz, U.P., Laursen, J.S., Ellekilde, L.-P., Axelsen, H.B.: Towards a domain-specific language for reversible assembly sequences. In: Krivine, J., Stefani, J.-B. (eds.) RC 2015. LNCS, vol. 9138, pp. 111\u2013126. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20860-2_7"},{"key":"21_CR18","unstructured":"Thomsen, M.K.: A functional language for describing reversible logic. In: Specification & Design Languages, FDL 2012, pp. 135\u2013142. IEEE (2012)"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Thomsen, M.K., Axelsen, H.B.: Interpretation and programming of the reversible functional language. In: Symposium on the Implementation and Application of Functional Programming Languages, IFL 2015, pp. 8:1\u20138:13. ACM (2016)","DOI":"10.1145\/2897336.2897345"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Linear types can change the world! In: IFIP TC 2 Working Conference on Programming Concepts and Methods, pp. 347\u2013359. North Holland (1990)","DOI":"10.1145\/99370.99404"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-29517-1_2","volume-title":"Reversible Computation","author":"T Yokoyama","year":"2012","unstructured":"Yokoyama, T., Axelsen, H.B., Gl\u00fcck, R.: Towards a reversible functional language. In: De Vos, A., Wille, R. (eds.) RC 2011. LNCS, vol. 7165, pp. 14\u201329. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29517-1_2"},{"key":"21_CR22","doi-asserted-by":"publisher","unstructured":"Yokoyama, T., Axelsen, H.B., Gl\u00fcck, R.: Fundamentals of reversible flowchart languages. Theor. Comput. Sci. (2015) (in Press), https:\/\/doi.org\/10.1016\/j.tcs.2015.07.046","DOI":"10.1016\/j.tcs.2015.07.046"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Yokoyama, T., Gl\u00fcck, R.: A reversible programming language and its invertible self-interpreter. In: Partial Evaluation and Program Manipulation, PEPM 2007, pp. 144\u2013153. ACM (2007)","DOI":"10.1145\/1244381.1244404"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99498-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T12:51:45Z","timestamp":1751806305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99498-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319994970","9783319994987"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99498-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}