{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:13:14Z","timestamp":1742998394916,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030232191"},{"type":"electronic","value":"9783030232207"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-23220-7_5","type":"book-chapter","created":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T13:32:01Z","timestamp":1561469521000},"page":"87-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finite Limits and Anti-unification in Substitution Categories"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6355-214X","authenticated-orcid":false,"given":"Wolfram","family":"Kahl","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,26]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0747-7171(85)80027-4","volume":"1","author":"E Eder","year":"1985","unstructured":"Eder, E.: Properties of substitutions and unifications. J. Symbolic Comput. 1, 31\u201346 (1985). https:\/\/doi.org\/10.1016\/S0747-7171(85)80027-4","journal-title":"J. Symbolic Comput."},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BFb0017395","volume-title":"Graph Grammars and Their Application to Computer Science","author":"H Ehrig","year":"1991","unstructured":"Ehrig, H., Habel, A., Kreowski, H.-J., Parisi-Presicce, F.: From graph grammars to high level replacement systems. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars 1990. LNCS, vol. 532, pp. 269\u2013291. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0017395"},{"key":"5_CR3","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31188-2","volume-title":"Fundamentals of Algebraic Graph Transformation","author":"H Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. MTCSAES. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-31188-2"},{"issue":"1","key":"5_CR4","first-page":"51","volume":"57","author":"S Hosseini","year":"2016","unstructured":"Hosseini, S., Qasemi Nezhad, Y.: Equalizers in Kleisli categories. Cahiers de Topologie ed G\u00e9om\u00e9trie Diff\u00e9rentielle Cat\u00e9goriques 57(1), 51\u201376 (2016). http:\/\/cahierstgdc.com\/index.php\/volumes\/volume-lii-2016\/","journal-title":"Cahiers de Topologie ed G\u00e9om\u00e9trie Diff\u00e9rentielle Cat\u00e9goriques"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-662-44124-4_9","volume-title":"Coalgebraic Methods in Computer Science","author":"W Kahl","year":"2014","unstructured":"Kahl, W.: Categories of coalgebras with monadic homomorphisms. In: Bonsangue, M.M. (ed.) CMCS 2014. LNCS, vol. 8446, pp. 151\u2013167. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44124-4_9. Agda theories at http:\/\/RelMiCS.McMaster.ca\/RATH-Agda\/"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"5:1","DOI":"10.14279\/tuj.eceasst.71.999","volume":"71","author":"W Kahl","year":"2015","unstructured":"Kahl, W.: Graph transformation with symbolic attributes via monadic coalgebra homomorphisms. ECEASST 71, 5:1\u20135:17 (2015). https:\/\/doi.org\/10.14279\/tuj.eceasst.71.999","journal-title":"ECEASST"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-24727-2_20","volume-title":"Foundations of Software Science and Computation Structures","author":"S Lack","year":"2004","unstructured":"Lack, S., Soboci\u0144ski, P.: Adhesive categories. In: Walukiewicz, I. (ed.) FoSSaCS 2004. LNCS, vol. 2987, pp. 273\u2013288. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24727-2_20"},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1051\/ita:2005028","volume":"39","author":"S Lack","year":"2005","unstructured":"Lack, S., Soboci\u0144ski, P.: Adhesive and quasiadhesive categories. RAIRO Inform. Th\u00e9or. Appl. 39(3), 511\u2013545 (2005). https:\/\/doi.org\/10.1051\/ita:2005028","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"869","DOI":"10.2307\/2272673","volume":"50","author":"FW Lawvere","year":"1963","unstructured":"Lawvere, F.W.: Functorial semantics of algebraic theories. Proc. Nat. Acad. Sci. USA 50, 869\u2013872 (1963). https:\/\/doi.org\/10.2307\/2272673","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"5_CR10","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 (2007). See also http:\/\/wiki.portal.chalmers.se\/agda\/pmwiki.php"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-18508-9_23","volume-title":"Category Theory and Computer Science","author":"DE Rydeheard","year":"1987","unstructured":"Rydeheard, D.E., Stell, J.G.: Foundations of equational deduction: a categorical treatment of equational proofs and unification algorithms. In: Pitt, D.H., Poign\u00e9, A., Rydeheard, D.E. (eds.) Category Theory and Computer Science. LNCS, vol. 283, pp. 114\u2013139. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-18508-9_23"},{"key":"5_CR12","unstructured":"Szigeti, J.: On limits and colimits in the Kleisli category. Cahiers de Topologie ed G\u00e9om\u00e9trie Diff\u00e9rentielle Cat\u00e9goriques 24(4), 381\u2013391 (1983). http:\/\/www.numdam.org\/item?id=CTGDC_1983_24_4_381_0"}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Algebraic Development Techniques"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23220-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:02:42Z","timestamp":1687651362000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-23220-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030232191","9783030232207"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23220-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algebraic Development Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Egham","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wadt18.cs.rhul.ac.uk\/","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":"2,85","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,17","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}