{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:31:44Z","timestamp":1743017504381,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030572006"},{"type":"electronic","value":"9783030572013"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-57201-3_10","type":"book-chapter","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T23:20:00Z","timestamp":1597965600000},"page":"180-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Semantics for First-Order Affine Inductive Data Types via Slice Categories"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Zamdzhiev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,21]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Borceux, F.: Handbook of Categorical Algebra: Volume 1, Basic Category Theory, vol. 1. Cambridge University Press, Cambridge (1994)","key":"10_CR1","DOI":"10.1017\/CBO9780511525858"},{"issue":"POPL","key":"10_CR2","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/3290345","volume":"3","author":"P Clairambault","year":"2019","unstructured":"Clairambault, P., de Visme, M., Winskel, G.: Game semantics for quantum programming. PACMPL 3(POPL), 321\u20133229 (2019). https:\/\/doi.org\/10.1145\/3290345","journal-title":"PACMPL"},{"key":"10_CR3","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/BFb0063098","volume-title":"Category Seminar","author":"B Day","year":"1974","unstructured":"Day, B.: On closed categories of functors II. In: Kelly, G.M. (ed.) Category Seminar. LNM, vol. 420, pp. 20\u201354. Springer, Heidelberg (1974). https:\/\/doi.org\/10.1007\/BFb0063098"},{"unstructured":"Fiore, M.P.: Axiomatic domain theory in categories of partial maps. Ph.D. thesis, University of Edinburgh, UK (1994)","key":"10_CR4"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J Girard","year":"1987","unstructured":"Girard, J.: Linear logic. Theor. Comput. Sci. 50, 1\u2013102 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90045-4","journal-title":"Theor. Comput. Sci."},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BFb0037107","volume-title":"Typed Lambda Calculi and Applications","author":"B Jacobs","year":"1993","unstructured":"Jacobs, B.: Semantics of lambda-I and of other substructure lambda calculi. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol. 664, pp. 195\u2013208. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/BFb0037107"},{"issue":"12","key":"10_CR7","doi-asserted-by":"publisher","first-page":"1750085","DOI":"10.1142\/S0129167X17500859","volume":"28","author":"A Kornell","year":"2017","unstructured":"Kornell, A.: Quantum collections. Int. J. Math. 28(12), 1750085 (2017). https:\/\/doi.org\/10.1142\/S0129167X17500859","journal-title":"Int. J. Math."},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/3-540-36576-1_20","volume-title":"Foundations of Software Science and Computation Structures","author":"J Laird","year":"2003","unstructured":"Laird, J.: A game semantics of linearly used continuations. In: Gordon, A.D. (ed.) FoSSaCS 2003. LNCS, vol. 2620, pp. 313\u2013327. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36576-1_20"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01752392","volume":"14","author":"DJ Lehmann","year":"1981","unstructured":"Lehmann, D.J., Smyth, M.B.: Algebraic specification of data types: a synthetic approach. Math. Syst. Theory 14, 97\u2013135 (1981). https:\/\/doi.org\/10.1007\/BF01752392","journal-title":"Math. Syst. Theory"},{"issue":"ICFP","key":"10_CR10","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1145\/3341715","volume":"3","author":"B Lindenhovius","year":"2019","unstructured":"Lindenhovius, B., Mislove, M., Zamdzhiev, V.: Mixed linear and non-linear recursive types. Proc. ACM Program. Lang. 3(ICFP), 1111\u201311129 (2019). https:\/\/doi.org\/10.1145\/3341715","journal-title":"Proc. ACM Program. Lang."},{"unstructured":"Lindenhovius, B., Mislove, M., Zamdzhiev, V.: Semantics for a lambda calculus for string diagrams (2020). preprint","key":"10_CR11"},{"doi-asserted-by":"publisher","unstructured":"Lindenhovius, B., Mislove, M.W., Zamdzhiev, V.: Enriching a Linear\/non-linear Lambda Calculus: a programming language for string diagrams. In: Dawar, A., Gr\u00e4del, E. (eds.) Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, 09\u201312 July 2018, pp. 659\u2013668. ACM (2018). https:\/\/doi.org\/10.1145\/3209108.3209196","key":"10_CR12","DOI":"10.1145\/3209108.3209196"},{"unstructured":"Lindenhovius, B., Mislove, M.W., Zamdzhiev, V.: LNL-FPC: the linear\/non-linear fixpoint calculus (2020). preprint. http:\/\/arxiv.org\/abs\/1906.09503","key":"10_CR13"},{"unstructured":"Mellies, P.A.: Categorical semantics of linear logic. Panoramas et syntheses 27, 15\u2013215 (2009)","key":"10_CR14"},{"doi-asserted-by":"publisher","unstructured":"Pagani, M., Selinger, P., Valiron, B.: Applying quantitative semantics to higher-order quantum computing. In: Jagannathan, S., Sewell, P. (eds.) The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014, San Diego, CA, USA, 20\u201321 January 2014. pp. 647\u2013658. ACM (2014). https:\/\/doi.org\/10.1145\/2535838.2535879","key":"10_CR15","DOI":"10.1145\/2535838.2535879"},{"doi-asserted-by":"crossref","unstructured":"P\u00e9choux, R., Perdrix, S., Rennela, M., Zamdzhiev, V.: Quantum programming with inductive datatypes (2020). preprint","key":"10_CR16","DOI":"10.1007\/978-3-030-45231-5_29"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/978-3-030-45231-5_29","volume-title":"Foundations of Software Science and Computation Structures","author":"R P\u00e9choux","year":"2020","unstructured":"P\u00e9choux, R., Perdrix, S., Rennela, M., Zamdzhiev, V.: Quantum programming with inductive datatypes: causality and affine type theory. FoSSaCS 2020. LNCS, vol. 12077, pp. 562\u2013581. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45231-5_29"},{"doi-asserted-by":"publisher","unstructured":"Rios, F., Selinger, P.: A categorical model for a quantum circuit description language. In: QPL 2017 (2017). https:\/\/doi.org\/10.4204\/EPTCS.266.11","key":"10_CR18","DOI":"10.4204\/EPTCS.266.11"},{"issue":"4","key":"10_CR19","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1017\/S0960129504004256","volume":"14","author":"P Selinger","year":"2004","unstructured":"Selinger, P.: Towards a quantum programming language. Math. Struct. Comput. Sci. 14(4), 527\u2013586 (2004). https:\/\/doi.org\/10.1017\/S0960129504004256","journal-title":"Math. Struct. Comput. Sci."},{"doi-asserted-by":"publisher","unstructured":"Selinger, P., Valiron, B.: Quantum Lambda Calculus (2009). https:\/\/doi.org\/10.1017\/CBO9781139193313.005","key":"10_CR20","DOI":"10.1017\/CBO9781139193313.005"},{"issue":"4","key":"10_CR21","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1137\/0211062","volume":"11","author":"MB Smyth","year":"1982","unstructured":"Smyth, M.B., Plotkin, G.D.: The category-theoretic solution of recursive domain equations. SIAM J. Comput. 11(4), 761\u2013783 (1982). https:\/\/doi.org\/10.1137\/0211062","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"publisher","unstructured":"Takesaki, M.: Theory of Operator Algebras, vol. I. II and III. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/978-1-4612-6188-9","key":"10_CR22","DOI":"10.1007\/978-1-4612-6188-9"},{"issue":"5886","key":"10_CR23","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1038\/299802a0","volume":"299","author":"WK Wootters","year":"1982","unstructured":"Wootters, W.K., Zurek, W.H.: A single quantum cannot be cloned. Nature 299(5886), 802\u2013803 (1982)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Coalgebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57201-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,22]],"date-time":"2024-08-22T12:37:32Z","timestamp":1724330252000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57201-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030572006","9783030572013"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57201-3_10","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":"21 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CMCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Coalgebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","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":"25 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cmcs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.coalg.org\/cmcs20\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"13","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":"9","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":"69% - 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-3","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":"There were several online events in September and October of 2020.","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"}]}}