{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:01:27Z","timestamp":1649203287974},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,11,20]],"date-time":"2014-11-20T00:00:00Z","timestamp":1416441600000},"content-version":"vor","delay-in-days":4859,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,8]]},"DOI":"10.1016\/s1571-0661(04)00169-0","type":"journal-article","created":{"date-parts":[[2004,1,29]],"date-time":"2004-01-29T10:14:39Z","timestamp":1075371279000},"page":"130-144","source":"Crossref","is-referenced-by-count":0,"title":["On intuitionistic proof nets with additional rewrite rules and their approximations"],"prefix":"10.1016","volume":"50","author":[{"given":"Satoshi","family":"Matsuoka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00169-0_NEWBIB1","doi-asserted-by":"crossref","unstructured":"I. Cervesato and F. Pfenning. Linear Higher-Order Pre-Unification. LICS'97, 1997.","DOI":"10.1109\/LICS.1997.614967"},{"key":"10.1016\/S1571-0661(04)00169-0_NEWBIB2","doi-asserted-by":"crossref","unstructured":"R. Di Cosmo and D. Kesner. Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets. LICS'97, 1997.","DOI":"10.1109\/LICS.1997.614927"},{"key":"10.1016\/S1571-0661(04)00169-0_NEWBIB3","doi-asserted-by":"crossref","unstructured":"R. Di Cosmo and S. Guerrini. Strong normalization of proof nets modulo structural congruences. RTA'99, 1999.","DOI":"10.1007\/3-540-48685-2_6"},{"key":"10.1016\/S1571-0661(04)00169-0_NEWBIB4","series-title":"Advances in Linear Logic, London Mathematical Society Lecture Notes Series 222","first-page":"307","article-title":"Proof-nets and the Hilbert space","author":"Danos","year":"1995"},{"key":"10.1016\/S1571-0661(04)00169-0_NEWBIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00169-0_NEWBIB6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","article-title":"A Unification Algorithm for Typed \u03bb-Calculus","volume":"1","author":"Huet","year":"1975","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00169-0_NEWBIB7","series-title":"Advances in Linear Logic, London Mathematical Society Lecture Notes Series 222","first-page":"225","article-title":"From Proof-Nets to Interaction Nets","author":"Lafont","year":"1995"},{"key":"10.1016\/S1571-0661(04)00169-0_NEWBIB8","unstructured":"S. Matsuoka. Some Applications of Linear Logic to Automated Theorem Proving and Logic Programming (in Japanese). Dissertation, Department of Electrical and Computer Engineering, Faculty of Engineering, Nagoya Institute of Technology, March, 2000."},{"key":"10.1016\/S1571-0661(04)00169-0_NEWBIB9","doi-asserted-by":"crossref","unstructured":"S. Matsuoka. Higher Order Pre-Unification on Intuitionistic Proof Nets (Extended Abstract). Proceedings of the 4th Asian Symposium on Computer Mathematics, pp 138\u2013141, World Scientific, 2000.","DOI":"10.1142\/9789812791962_0019"},{"key":"10.1016\/S1571-0661(04)00169-0_NEWBIB10","doi-asserted-by":"crossref","unstructured":"S. Matsuoka. Higher Order Pre-Unification on Intuitionistic Proof Nets with Exponentials. Preparation, 2001.","DOI":"10.1142\/9789812791962_0019"},{"key":"10.1016\/S1571-0661(04)00169-0_NEWBIB11","unstructured":"G. Nadathur and D. Miller. An Overview of \u03bbProlog. In Fifth International Logic Programming Conference, pages 810\u2013827, MIT Press, 1988."},{"key":"10.1016\/S1571-0661(04)00169-0_NEWBIB12","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0747-7171(89)80023-9","article-title":"Higher Order Unification Revisited: Complete Sets of Transformations","volume":"8","author":"Snyder","year":"1989","journal-title":"Journal of Symbolic Computation"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001690?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001690?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,29]],"date-time":"2020-03-29T12:28:56Z","timestamp":1585484936000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104001690"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["S1571066104001690"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00169-0","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}