{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:18:46Z","timestamp":1753438726705,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662466773"},{"type":"electronic","value":"9783662466780"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46678-0_28","type":"book-chapter","created":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T13:42:21Z","timestamp":1427895741000},"page":"436-450","source":"Crossref","is-referenced-by-count":3,"title":["On the Dependencies of Logical Rules"],"prefix":"10.1007","author":[{"given":"Marc","family":"Bagnol","sequence":"first","affiliation":[]},{"given":"Amina","family":"Doumane","sequence":"additional","affiliation":[]},{"given":"Alexis","family":"Saurin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Bagnol, M., Doumane, A., Saurin, A.: On the dependencies of logical rules. long version at http:\/\/www.pps.univ-paris-diderot.fr\/~saurin\/Publi\/DepGraphLong.pdf"},{"key":"28_CR2","first-page":"479","volume-title":"To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism","author":"W.A. Howard","year":"1980","unstructured":"Howard, W.A.: The formulae-as-type notion of construction. In: Seldin, J.P., Hindley, R. (eds.) To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism, pp. 479\u2013490. Academic Press, New York (1980)"},{"issue":"1","key":"28_CR3","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. Theoretical Computer Science\u00a050(1), 1\u2013101 (1987)","journal-title":"Theoretical Computer Science"},{"key":"28_CR4","unstructured":"Girard, J.Y.: Interpr\u00e9tation fonctionnelle et \u00e9limination des coupures de l\u2019arithm\u00e9tique d\u2019ordre sup\u00e9rieur. Th\u00e8se de doctorat, Universit\u00e9 Paris VII (1972)"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/3-540-06859-7_148","volume-title":"Programming Symposium","author":"J.C. Reynolds","year":"1974","unstructured":"Reynolds, J.C.: Towards a theory of type structure. In: Robinet, B. (ed.) Programming Symposium. LNCS, vol.\u00a019, pp. 408\u2013423. Springer, Heidelberg (1974)"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0304-3975(86)90044-7","volume":"45","author":"J.Y. Girard","year":"1986","unstructured":"Girard, J.Y.: The system F of variable types, fifteen years later. Theoretical Computer Science\u00a045, 159\u2013192 (1986)","journal-title":"Theoretical Computer Science"},{"key":"28_CR7","series-title":"Lecture Notes In Pure and Applied Mathematics","first-page":"97","volume-title":"Logic and Algebra","author":"J.Y. Girard","year":"1996","unstructured":"Girard, J.Y.: Proof-nets: the parallel syntax for proof-theory. In: Ursini, A., Agliano, P. (eds.) Logic and Algebra. Lecture Notes In Pure and Applied Mathematics, vol.\u00a0180, pp. 97\u2013124. Marcel Dekker, New York (1996)"},{"key":"28_CR8","unstructured":"Danos, V., Regnier, L.: The structure of multiplicatives 28, 181\u2013203 (1989)"},{"key":"28_CR9","unstructured":"Curien, P.L.: Introduction to linear logic and ludics, part ii (2006)"},{"key":"28_CR10","unstructured":"Girard, J.Y.: Le Point Aveugle: Cours de logique. Tome 1, Vers la perfection; Tome 2, Vers l\u2019imperfection. Hermann (2006)"},{"key":"28_CR11","unstructured":"Danos, V.: Une application de la logique lin\u00e9aire \u00e0 l\u2019\u00e8tude des processus de normalisation. (principalement du \u03bb-calcul). Th\u00e8se de doctorat, Universit\u00e9 Denis Diderot, Paris 7 (1990)"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Guerrini, S.: Correctness of multiplicative proof nets is linear. In: LICS, pp. 454\u2013463. IEEE Computer Society (1999)","DOI":"10.1109\/LICS.1999.782640"},{"issue":"20","key":"28_CR13","doi-asserted-by":"publisher","first-page":"1958","DOI":"10.1016\/j.tcs.2010.12.021","volume":"412","author":"S. Guerrini","year":"2011","unstructured":"Guerrini, S.: A linear algorithm for MLL proof net correctness and sequentialization. Theor. Comput. Sci.\u00a0412(20), 1958\u20131978 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"28_CR14","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1145\/1149114.1149116","volume":"7","author":"A.S. Murawski","year":"2006","unstructured":"Murawski, A.S., Ong, C.H.L.: Fast verification of mll proof nets via imll. ACM Trans. Comput. Logic\u00a07(3), 473\u2013498 (2006)","journal-title":"ACM Trans. Comput. Logic"},{"issue":"20","key":"28_CR15","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1016\/j.tcs.2010.12.020","volume":"412","author":"P.J. Naurois de","year":"2011","unstructured":"de Naurois, P.J., Mogbil, V.: Correctness of linear logic proof structures is NL-complete. Theor. Comput. Sci.\u00a0412(20), 1941\u20131957 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR16","series-title":"IFIP","first-page":"383","volume-title":"TCS 2008","author":"K. Chaudhuri","year":"2008","unstructured":"Chaudhuri, K., Miller, D., Saurin, A.: Canonical sequent proofs via multi-focusing. In: Ausiello, G., Karhum\u00e4ki, J., Mauri, G., Ong, L. (eds.) TCS 2008. IFIP, vol.\u00a0273, pp. 383\u2013396. Springer, Boston (2008)"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Bellin, G., van de Wiele, J.: Subnets of proof-nets in MLL\u2009\u2212. In: Girard, Lafont, Regnier (eds.) Advances in Linear Logic, vol.\u00a0222, pp. 249\u2013270. CUP (1995)","DOI":"10.1017\/CBO9780511629150.013"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11874683_21","volume-title":"Computer Science Logic","author":"P. Giamberardino Di","year":"2006","unstructured":"Di Giamberardino, P., Faggian, C.: Jump from parallel to sequential proofs: Multiplicatives. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 319\u2013333. Springer, Heidelberg (2006)"},{"issue":"3","key":"28_CR19","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0168-0072(94)00033-Y","volume":"73","author":"R. Banach","year":"1995","unstructured":"Banach, R.: Sequent reconstruction in LLM - A sweepline proof. Ann. Pure Appl. Logic\u00a073(3), 277\u2013295 (1995)","journal-title":"Ann. Pure Appl. Logic"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46678-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T19:57:42Z","timestamp":1747857462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46678-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662466773","9783662466780"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46678-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}