{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:02:19Z","timestamp":1767927739288,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642370748","type":"print"},{"value":"9783642370755","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37075-5_26","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T19:37:23Z","timestamp":1361216243000},"page":"401-417","source":"Crossref","is-referenced-by-count":21,"title":["An Algebraic Presentation of Predicate Logic"],"prefix":"10.1007","author":[{"given":"Sam","family":"Staton","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","volume-title":"A general Church-Rosser theorem","author":"P. Aczel","year":"1978","unstructured":"Aczel, P.: A general Church-Rosser theorem (1978)"},{"issue":"1-3","key":"26_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0022-4049(02)00126-3","volume":"175","author":"J. Ad\u00e1mek","year":"2002","unstructured":"Ad\u00e1mek, J., Borceux, F., Lack, S., Rosick\u00fd, J.: A classification of accessible categories. J. Pure Appl. Algebra\u00a0175(1-3), 7\u201330 (2002)","journal-title":"J. Pure Appl. Algebra"},{"issue":"3","key":"26_CR3","first-page":"33","volume":"8","author":"J. Ad\u00e1mek","year":"2001","unstructured":"Ad\u00e1mek, J., Rosick\u00fd, J.: On sifted colimits and generalized varieties. Theory Appl. Categ.\u00a08(3), 33\u201353 (2001)","journal-title":"Theory Appl. Categ."},{"key":"26_CR4","unstructured":"Adams, R.: Lambda-free logical frameworks. Ann. Pure Appl. Logic (to appear)"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-12032-9_21","volume-title":"Foundations of Software Science and Computational Structures","author":"T. Altenkirch","year":"2010","unstructured":"Altenkirch, T., Chapman, J., Uustalu, T.: Monads Need Not Be Endofunctors. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol.\u00a06014, pp. 297\u2013311. Springer, Heidelberg (2010)"},{"issue":"46","key":"26_CR6","doi-asserted-by":"publisher","first-page":"4626","DOI":"10.1016\/j.tcs.2009.07.038","volume":"410","author":"G. Amato","year":"2009","unstructured":"Amato, G., Lipton, J., McGrail, R.: On the algebraic structure of declarative programming languages. Theor. Comput. Sci.\u00a0410(46), 4626\u20134671 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"26_CR7","first-page":"74","volume":"53","author":"S. Antoy","year":"2010","unstructured":"Antoy, S., Hanus, M.: Functional logic programming. C.\u00a0ACM\u00a053(4), 74\u201385 (2010)","journal-title":"C.\u00a0ACM"},{"key":"26_CR8","unstructured":"Asperti, A., Martini, S.: Projections instead of variables: A category theoretic interpretation of logic programs. In: Proc. ICLP 1989 (1989)"},{"key":"26_CR9","unstructured":"Bauer, A., Pretnar, M.: Programming with algebraic effects and handlers. arXiv:1203.1539v1"},{"issue":"8-9","key":"26_CR10","doi-asserted-by":"publisher","first-page":"2029","DOI":"10.1016\/j.jpaa.2012.02.039","volume":"216","author":"C. Berger","year":"2012","unstructured":"Berger, C., Melli\u00e8s, P.-A., Weber, M.: Monads with arities and their associated theories. J.\u00a0Pure Appl. Algebra\u00a0216(8-9), 2029\u20132048 (2012)","journal-title":"J.\u00a0Pure Appl. Algebra"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-20775-4_2","volume-title":"Functional and Constraint Logic Programming","author":"B. Bra\u00dfel","year":"2011","unstructured":"Bra\u00dfel, B., Fischer, S., Hanus, M., Reck, F.: Transforming Functional Logic Programs into Monadic Functional Programs. In: Mari\u00f1o, J. (ed.) WFLP 2010. LNCS, vol.\u00a06559, pp. 30\u201347. Springer, Heidelberg (2011)"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-53162-9_33","volume-title":"Algebraic and Logic Programming","author":"F. Bronsard","year":"1990","unstructured":"Bronsard, F., Reddy, U.S.: Axiomatization of a Functional Logic Language. In: Kirchner, H., Wechler, W. (eds.) ALP 1990. LNCS, vol.\u00a0463, pp. 101\u2013116. Springer, Heidelberg (1990)"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Clouston, R.A., Pitts, A.M.: Nominal equational logic. In: Computation, Meaning, and Logic. Elsevier (2007)","DOI":"10.1016\/j.entcs.2007.02.009"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Cohn, P.M.: Universal algebra, 2nd edn. D Reidel (1981)","DOI":"10.1007\/978-94-009-8399-1"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Curien, P.-L.: Operads, clones and distributive laws. In: Operads and Universal Algebra. World Scientific (2012)","DOI":"10.1142\/9789814365123_0002"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BFb0022261","volume-title":"Computer Science Logic","author":"S.E. Finkelstein","year":"1995","unstructured":"Finkelstein, S.E., Freyd, P.J., Lipton, J.: Logic Programming in Tau Categories. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol.\u00a0933, pp. 249\u2013263. Springer, Heidelberg (1995)"},{"key":"26_CR17","unstructured":"Fiore, M., Plotkin, G., Turi, D.: Abstract syntax and variable binding. In: Proc.\u00a0LICS 1999 (1999)"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-642-15205-4_26","volume-title":"Computer Science Logic","author":"M. Fiore","year":"2010","unstructured":"Fiore, M., Hur, C.-K.: Second-Order Equational Logic (Extended Abstract). In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol.\u00a06247, pp. 320\u2013335. Springer, Heidelberg (2010)"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-15155-2_33","volume-title":"Mathematical Foundations of Computer Science 2010","author":"M. Fiore","year":"2010","unstructured":"Fiore, M., Mahmoud, O.: Second-Order Algebraic Theories. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 368\u2013380. Springer, Heidelberg (2010)"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Gabbay, M.J., Mathijssen, A.: One and a halfth order logic. J. Logic Comput.\u00a018 (2008)","DOI":"10.1093\/logcom\/exm064"},{"key":"26_CR21","unstructured":"Jagadeesan, R., Panangaden, P., Pingali, K.: A fully abstract semantics for a functional language with logic variables. In: LICS 1989 (1989)"},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"Johann, P., Simpson, A., Voigtl\u00e4nder, J.: A generic operational metatheory for algebraic effects. In: LICS 2010 (2010)","DOI":"10.1109\/LICS.2010.29"},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"Johnstone, P.T.: Sketches of an Elephant. OUP (2002)","DOI":"10.1093\/oso\/9780198515982.003.0007"},{"key":"26_CR24","doi-asserted-by":"crossref","unstructured":"Kammar, O., Plotkin, G.D.: Algebraic foundations for effect-dependent optimisations. In: Proc.\u00a0POPL 2012 (2012)","DOI":"10.1145\/2103656.2103698"},{"key":"26_CR25","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0022-4049(93)90092-8","volume":"89","author":"G.M. Kelly","year":"1993","unstructured":"Kelly, G.M., Power, A.J.: Adjunctions whose counits are coequalisers. J.\u00a0Pure Appl. Algebra\u00a089, 163\u2013179 (1993)","journal-title":"J.\u00a0Pure Appl. Algebra"},{"key":"26_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-60983-0_12","volume-title":"Extensions of Logic Programming","author":"Y. Kinoshita","year":"1996","unstructured":"Kinoshita, Y., Power, A.J.: A fibrational Semantics for Logic Programs. In: Herre, H., Dyckhoff, R., Schroeder-Heister, P. (eds.) ELP 1996. LNCS, vol.\u00a01050, pp. 177\u2013191. Springer, Heidelberg (1996)"},{"key":"26_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-642-22944-2_19","volume-title":"Algebra and Coalgebra in Computer Science","author":"E. Komendantskaya","year":"2011","unstructured":"Komendantskaya, E., Power, J.: Coalgebraic Semantics for Derivations in Logic Programming. In: Corradini, A., Klin, B., C\u00eerstea, C. (eds.) CALCO 2011. LNCS, vol.\u00a06859, pp. 268\u2013282. Springer, Heidelberg (2011)"},{"issue":"12","key":"26_CR28","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1016\/j.ic.2009.11.007","volume":"208","author":"A. Kurz","year":"2010","unstructured":"Kurz, A., Petri\u015fan, D.: Presenting functors on many-sorted varieties and applications. Inform. Comput.\u00a0208(12), 1421\u20131446 (2010)","journal-title":"Inform. Comput."},{"key":"26_CR29","doi-asserted-by":"crossref","unstructured":"Lack, S., Rosick\u00fd, J.: Notions of Lawvere theory. Appl. Categ. Structures\u00a019(1) (2011)","DOI":"10.1007\/s10485-009-9215-2"},{"key":"26_CR30","doi-asserted-by":"crossref","unstructured":"Melli\u00e8s, P.-A.: Segal condition meets computational effects. In: Proc. LICS 2010 (2010)","DOI":"10.1109\/LICS.2010.46"},{"key":"26_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-642-22944-2_21","volume-title":"Algebra and Coalgebra in Computer Science","author":"R.E. M\u00f8gelberg","year":"2011","unstructured":"M\u00f8gelberg, R.E., Staton, S.: Linearly-Used State in Models of Call-by-Value. In: Corradini, A., Klin, B., C\u00eerstea, C. (eds.) CALCO 2011. LNCS, vol.\u00a06859, pp. 298\u2013313. Springer, Heidelberg (2011)"},{"key":"26_CR32","doi-asserted-by":"crossref","unstructured":"Moggi, E.: Notions of computation and monads. Inform. Comput.\u00a093(1) (1991)","DOI":"10.1016\/0890-5401(91)90052-4"},{"issue":"3&4","key":"26_CR33","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0743-1066(92)90024-W","volume":"12","author":"J.J. Moreno-Navarro","year":"1992","unstructured":"Moreno-Navarro, J.J., Rodr\u00edguez-Artalejo, M.: Logic programming with functions and predicates. J. Log. Program\u00a012(3&4), 191\u2013223 (1992)","journal-title":"J. Log. Program"},{"key":"26_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/11780274_8","volume-title":"Goguen Festschrift","author":"G. Plotkin","year":"2006","unstructured":"Plotkin, G.: Some Varieties of Equational Logic. In: Futatsugi, K., Jouannaud, J.-P., Meseguer, J. (eds.) Goguen Festschrift. LNCS, vol.\u00a04060, pp. 150\u2013156. Springer, Heidelberg (2006)"},{"key":"26_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-45931-6_24","volume-title":"Foundations of Software Science and Computation Structures","author":"G. Plotkin","year":"2002","unstructured":"Plotkin, G., Power, J.: Notions of Computation Determine Monads. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 342\u2013356. Springer, Heidelberg (2002)"},{"issue":"1","key":"26_CR36","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/A:1023064908962","volume":"11","author":"G.D. Plotkin","year":"2003","unstructured":"Plotkin, G.D., Power, J.: Algebraic operations and generic effects. Appl. Categ. Structures\u00a011(1), 69\u201394 (2003)","journal-title":"Appl. Categ. Structures"},{"key":"26_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-00590-9_7","volume-title":"Programming Languages and Systems","author":"G. Plotkin","year":"2009","unstructured":"Plotkin, G., Pretnar, M.: Handlers of Algebraic Effects. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol.\u00a05502, pp. 80\u201394. Springer, Heidelberg (2009)"},{"key":"26_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/3-540-18420-1_68","volume-title":"Graph Reduction","author":"U.S. Reddy","year":"1987","unstructured":"Reddy, U.S.: Functional Logic Languages, Part I. In: Fasel, J.H., Keller, R.M. (eds.) Graph Reduction 1986. LNCS, vol.\u00a0279, pp. 401\u2013425. Springer, Heidelberg (1987)"},{"key":"26_CR39","doi-asserted-by":"crossref","unstructured":"Saraswat, V.A., Rinard, M.C., Panangaden, P.: Semantic foundations of concurrent constraint programming. In: Proc.\u00a0POPL 1991, pp. 333\u2013352 (1991)","DOI":"10.1145\/99583.99627"},{"key":"26_CR40","doi-asserted-by":"crossref","unstructured":"Schrijvers, T., Stuckey, P.J., Wadler, P.: Monadic constraint programming. J. Funct. Program.\u00a019(6) (2009)","DOI":"10.1017\/S0956796809990086"},{"key":"26_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-03741-2_14","volume-title":"Algebra and Coalgebra in Computer Science","author":"S. Staton","year":"2009","unstructured":"Staton, S.: Relating Coalgebraic Notions of Bisimulation. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol.\u00a05728, pp. 191\u2013205. Springer, Heidelberg (2009)"},{"key":"26_CR42","doi-asserted-by":"crossref","unstructured":"Velebil, J., Kurz, A.: Equational presentations of functors and monads. Math. Struct. in Comp. Science\u00a021 (2011)","DOI":"10.1017\/S0960129510000575"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37075-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T04:47:32Z","timestamp":1714970852000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37075-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370748","9783642370755"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37075-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}