{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T05:24:29Z","timestamp":1740461069369,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152047"},{"type":"electronic","value":"9783642152054"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15205-4_37","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T14:48:24Z","timestamp":1281710904000},"page":"484-498","source":"Crossref","is-referenced-by-count":6,"title":["Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic"],"prefix":"10.1007","author":[{"given":"Damien","family":"Pous","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"37_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"J.-M. Andreoli","year":"1992","unstructured":"Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. Journal of Logic and Computation\u00a02(3), 297\u2013347 (1992)","journal-title":"Journal of Logic and Computation"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s001530050101","volume":"37","author":"G. Bellin","year":"1998","unstructured":"Bellin, G., Fleury, A.: Planar and braided proof-nets for MLL with mix. Archive for Mathematical Logic\u00a037, 309\u2013325 (1998)","journal-title":"Archive for Mathematical Logic"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0304-3975(94)00104-9","volume":"135","author":"G. Bellin","year":"1994","unstructured":"Bellin, G., Scott, P.: On the \u03c0-calculus and linear logic. TCS\u00a0135, 11\u201365 (1994)","journal-title":"TCS"},{"key":"37_CR4","unstructured":"Braibant, T., Pous, D.: Coq library: ATBR, algebraic tools for binary relations (May 2009), http:\/\/sardes.inrialpes.fr\/~braibant\/atbr\/"},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-14052-5_13","volume-title":"Interactive Theorem Proving","author":"T. Braibant","year":"2010","unstructured":"Braibant, T., Pous, D.: An efficient coq tactic for deciding Kleene algebras. In: Kaufmann, M., Paulson, L.C. (eds.) Interactive Theorem Proving. LNCS, vol.\u00a06172, pp. 163\u2013178. Springer, Heidelberg (2010)"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Burmeister, P.: Partial Algebra. In: Algebras and Orders. Kluwer Pub., Dordrecht (1993)","DOI":"10.1007\/978-94-017-0697-1_1"},{"issue":"23-24","key":"37_CR7","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/j.ipl.2009.09.008","volume":"109","author":"R. Diaconescu","year":"2009","unstructured":"Diaconescu, R.: An encoding of partial algebras as total algebras. Information Processing Letters\u00a0109(23-24), 1245\u20131251 (2009)","journal-title":"Information Processing Letters"},{"issue":"4","key":"37_CR8","doi-asserted-by":"crossref","first-page":"375","DOI":"10.3233\/FUN-2004-63404","volume":"63","author":"N. Dojer","year":"2004","unstructured":"Dojer, N.: Applying term rewriting to partial algebra theory. Fundamenta Informaticae\u00a063(4), 375\u2013384 (2004)","journal-title":"Fundamenta Informaticae"},{"issue":"1-2","key":"37_CR9","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0304-3975(96)00154-5","volume":"179","author":"H. Doornbos","year":"1997","unstructured":"Doornbos, H., Backhouse, R., van der Woude, J.: A calculational approach to mathematical induction. TCS\u00a0179(1-2), 103\u2013135 (1997)","journal-title":"TCS"},{"key":"37_CR10","volume-title":"Categories, Allegories","author":"P. Freyd","year":"1990","unstructured":"Freyd, P., Scedrov, A.: Categories, Allegories. North-Holland, Amsterdam (1990)"},{"key":"37_CR11","first-page":"532","volume":"151","author":"N. Galatos","year":"2007","unstructured":"Galatos, N., Jipsen, P., Kowalski, T., Ono, H.: Residuated lattices: an algebraic glimpse at substructural logics. Stud. in Log. and Found. of Math.\u00a0151, 532 (2007)","journal-title":"Stud. in Log. and Found. of Math."},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. TCS\u00a050, 1\u2013102 (1987)","journal-title":"TCS"},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/11541868_7","volume-title":"Theorem Proving in Higher Order Logics","author":"B. Gr\u00e9goire","year":"2005","unstructured":"Gr\u00e9goire, B., Mahboubi, A.: Proving equalities in a commutative ring done right in Coq. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol.\u00a03603, pp. 98\u2013113. Springer, Heidelberg (2005)"},{"key":"37_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/3-540-57826-9_153","volume-title":"Higher Order Logic Theorem Proving and Its Applications","author":"J. Harrison","year":"1994","unstructured":"Harrison, J.: A HOL decision procedure for elementary real algebra. In: Joyce, J.J., Seger, C.-J.H. (eds.) HUG 1993. LNCS, vol.\u00a0780, pp. 426\u2013435. Springer, Heidelberg (1994)"},{"issue":"2","key":"37_CR15","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1023\/B:STUD.0000032089.54776.63","volume":"76","author":"P. Jipsen","year":"2004","unstructured":"Jipsen, P.: Semirings to residuated Kleene lattices. Stud. Log.\u00a076(2), 291\u2013303 (2004)","journal-title":"Stud. Log."},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Jipsen, P., Tsinakis, C.: A survey of residuated lattices. Ord. Alg. Struct. (2002)","DOI":"10.1007\/978-1-4757-3627-4_3"},{"key":"37_CR17","first-page":"486","volume-title":"Proc. LICS","author":"M. Kanovich","year":"1995","unstructured":"Kanovich, M.: The complexity of neutrals in linear logic. In: Proc. LICS, pp. 486\u2013495. IEEE, Los Alamitos (1995)"},{"key":"37_CR18","first-page":"3","volume-title":"Automata Studies","author":"S.C. Kleene","year":"1956","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Automata Studies, pp. 3\u201341. Princeton University Press, Princeton (1956)"},{"issue":"2","key":"37_CR19","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation\u00a0110(2), 366\u2013390 (1994)","journal-title":"Information and Computation"},{"issue":"3","key":"37_CR20","first-page":"427","volume":"19","author":"D. Kozen","year":"1997","unstructured":"Kozen, D.: Kleene algebra with tests. Trans. PLS\u00a019(3), 427\u2013443 (1997)","journal-title":"Trans. PLS"},{"key":"37_CR21","unstructured":"Kozen, D.: Typed Kleene algebra. Technical Report 98-1669, Cornell Univ. (1998)"},{"issue":"2","key":"37_CR22","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0304-3975(91)90395-I","volume":"89","author":"D. Krob","year":"1991","unstructured":"Krob, D.: Complete systems of B-rational identities. TCS\u00a089(2), 207\u2013343 (1991)","journal-title":"TCS"},{"key":"37_CR23","doi-asserted-by":"publisher","first-page":"154","DOI":"10.2307\/2310058","volume":"65","author":"J. Lambek","year":"1958","unstructured":"Lambek, J.: The mathematics of sentence structure. American Mathematical Monthly\u00a065, 154\u2013170 (1958)","journal-title":"American Mathematical Monthly"},{"issue":"2","key":"37_CR24","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/S0304-3975(01)00369-3","volume":"286","author":"T. Mossakowski","year":"2002","unstructured":"Mossakowski, T.: Relating CASL with other specification languages: the institution level. TCS\u00a0286(2), 367\u2013475 (2002)","journal-title":"TCS"},{"key":"37_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/10930755_5","volume-title":"Theorem Proving in Higher Order Logics","author":"M. Norrish","year":"2003","unstructured":"Norrish, M.: Complete integer decision procedures as derived rules in HOL. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol.\u00a02758, pp. 71\u201386. Springer, Heidelberg (2003)"},{"issue":"2","key":"37_CR26","doi-asserted-by":"publisher","first-page":"790","DOI":"10.2307\/2586501","volume":"64","author":"M. Okada","year":"1999","unstructured":"Okada, M., Terui, K.: The finite model property for various fragments of intuitionistic linear logic. Journal of Symbolic Logic\u00a064(2), 790\u2013802 (1999)","journal-title":"Journal of Symbolic Logic"},{"issue":"1","key":"37_CR27","doi-asserted-by":"publisher","first-page":"169","DOI":"10.2307\/2273798","volume":"50","author":"H. Ono","year":"1985","unstructured":"Ono, H., Komori, Y.: Logics without the contraction rule. Journal of Symbolic Logic\u00a050(1), 169\u2013201 (1985)","journal-title":"Journal of Symbolic Logic"},{"issue":"1-3","key":"37_CR28","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.tcs.2006.03.018","volume":"357","author":"M. Pentus","year":"2006","unstructured":"Pentus, M.: Lambek calculus is NP-complete. TCS\u00a0357(1-3), 186\u2013201 (2006)","journal-title":"TCS"},{"key":"37_CR29","unstructured":"Pous, D.: Web appendix of this paper, http:\/\/sardes.inrialpes.fr\/~pous\/utas"},{"key":"37_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BFb0018436","volume-title":"Logics in AI","author":"V.R. Pratt","year":"1991","unstructured":"Pratt, V.R.: Action logic and pure induction. In: van Eijck, J. (ed.) JELIA 1990. LNCS, vol.\u00a0478, pp. 97\u2013120. Springer, Heidelberg (1991)"},{"key":"37_CR31","unstructured":"Regnier, L.: Lambda-calcul et r\u00e9seaux. Th\u00e8se de doctorat, Univ. Paris VII (1992)"},{"key":"37_CR32","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s00012-005-1957-6","volume":"54","author":"A. Wille","year":"2005","unstructured":"Wille, A.: A Gentzen system for involutive residuated lattices. Algebra Universalis\u00a054, 449\u2013463 (2005)","journal-title":"Algebra Universalis"},{"issue":"1","key":"37_CR33","doi-asserted-by":"publisher","first-page":"41","DOI":"10.2307\/2274953","volume":"55","author":"D. Yetter","year":"1990","unstructured":"Yetter, D.: Quantales and (noncommutative) linear logic. Journal of Symbolic Logic\u00a055(1), 41\u201364 (1990)","journal-title":"Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15205-4_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T09:27:48Z","timestamp":1740389268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15205-4_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152047","9783642152054"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15205-4_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}