乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T22:33:26Z","timestamp":1726094006053},"publisher-location":"Cham","reference-count":18,"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_4","type":"book-chapter","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T23:20:00Z","timestamp":1597965600000},"page":"55-67","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Free-Algebra Functors from a Coalgebraic Perspective"],"prefix":"10.1007","author":[{"given":"H. Peter","family":"Gumm","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,21]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0304-3975(93)90076-6","volume":"114","author":"M Barr","year":"1993","unstructured":"Barr, M.: Terminal coalgebras in well-founded set theory. Theoret. Comput. Sci. 114(2), 299\u2013315 (1993). https:\/\/doi.org\/10.1016\/0304-3975(93)90076-6","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"167","DOI":"10.4153\/CMB-1969-016-6","volume":"12","author":"A Day","year":"1969","unstructured":"Day, A.: A characterization of modularity for congruence lattices of algebras. Can. Math. Bull. 12(2), 167\u2013173 (1969). https:\/\/doi.org\/10.4153\/CMB-1969-016-6","journal-title":"Can. Math. Bull."},{"issue":"4","key":"4_CR3","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00012-012-0186-z","volume":"67","author":"T Dent","year":"2012","unstructured":"Dent, T., Kearnes, K.A., Szendrei, \u00c1.: An easy test for congruence modularity. Algebra Univers. 67(4), 375\u2013392 (2012). https:\/\/doi.org\/10.1007\/s00012-012-0186-z","journal-title":"Algebra Univers."},{"issue":"4","key":"4_CR4","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s00012-013-0256-x","volume":"70","author":"R Freese","year":"2013","unstructured":"Freese, R.: Equations implying congruence n-permutability and semidistributivity. Algebra Univers. 70(4), 347\u2013357 (2013). https:\/\/doi.org\/10.1007\/s00012-013-0256-x","journal-title":"Algebra Univers."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/BF01223741","volume":"36","author":"HP Gumm","year":"1981","unstructured":"Gumm, H.P.: Congruence modularity is permutability composed with distributivity. Arch. Math 36, 569\u2013576 (1981). https:\/\/doi.org\/10.1007\/BF01223741","journal-title":"Arch. Math"},{"key":"4_CR6","unstructured":"Gumm, H.P.: Elements of the general theory of coalgebras. In: LUATCS 99. Rand Afrikaans University, Johannesburg, South Africa (1999). https:\/\/www.mathematik.uni-marburg.de\/~gumm\/Papers\/Luatcs.pdf"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11548133","volume-title":"Algebra and Coalgebra in Computer Science","year":"2005","unstructured":"Fiadeiro, J.L., Harman, N., Roggenbach, M., Rutten, J. (eds.): CALCO 2005. LNCS, vol. 3629. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11548133"},{"issue":"2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/s00012-020-00654-w","volume":"81","author":"HP Gumm","year":"2020","unstructured":"Gumm, H.P.: Connected monads weakly preserve products. Algebra Univers. 81(2), 18 (2020). https:\/\/doi.org\/10.1007\/s00012-020-00654-w","journal-title":"Algebra Univers."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s00012-005-1888-2","volume":"53","author":"HP Gumm","year":"2005","unstructured":"Gumm, H.P., Schr\u00f6der, T.: Types and coalgebraic structure. Algebra Univers. 53, 229\u2013252 (2005). https:\/\/doi.org\/10.1007\/s00012-005-1888-2","journal-title":"Algebra Univers."},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/BF02945100","volume":"3","author":"J Hagemann","year":"1973","unstructured":"Hagemann, J., Mitschke, A.: On n-permutable congruences. Algebra Univers. 3(1), 8\u201312 (1973). https:\/\/doi.org\/10.1007\/BF02945100","journal-title":"Algebra Univers."},{"key":"4_CR11","unstructured":"Henkel, C.: Klassifikation Coalgebraischer Typfunktoren. Diplomarbeit, Universit\u00e4t Marburg (2010)"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"110","DOI":"10.7146\/math.scand.a-10850","volume":"21","author":"B J\u00f3nsson","year":"1967","unstructured":"J\u00f3nsson, B.: Algebras whose congruence lattices are distributive. Math. Scand. 21, 110\u2013121 (1967). https:\/\/doi.org\/10.7146\/math.scand.a-10850","journal-title":"Math. Scand."},{"issue":"77","key":"4_CR13","first-page":"3","volume":"35","author":"AI Mal\u2019cev","year":"1954","unstructured":"Mal\u2019cev, A.I.: On the general theory of algebraic systems. Matematicheskii Sbornik (N.S.) 35(77), 3\u201320 (1954). (in Russian)","journal-title":"Matematicheskii Sbornik (N.S.)"},{"key":"4_CR14","first-page":"125","volume":"27","author":"AI Mal\u2019tsev","year":"1963","unstructured":"Mal\u2019tsev, A.I.: On the general theory of algebraic systems. Am. Math. Soc. 27, 125\u2013142 (1963). Transl., Ser. 2","journal-title":"Am. Math. Soc."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J Rutten","year":"2000","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. Theoret. Comput. Sci. 249, 3\u201380 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(00)00056-6","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR16","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. Techical report, CWI, Amsterdam (1996). CS-R9652"},{"key":"4_CR17","unstructured":"Selinger, P.: Functionality, polymorphism, and concurrency: a mathematical investigation of programming paradigms. Technical report, IRCS 97\u201317, University of Pennsylvania (1997). https:\/\/repository.upenn.edu\/ircs_reports\/88\/"},{"key":"4_CR18","unstructured":"Trnkov\u00e1, V.: On descriptive classification of set-functors. I. Comm. Math. Univ. Carolinae 12, 143\u2013174 (1971). https:\/\/eudml.org\/doc\/16419"}],"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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,22]],"date-time":"2024-08-22T12:36:58Z","timestamp":1724330218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57201-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030572006","9783030572013"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57201-3_4","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"}]}}