{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:11Z","timestamp":1761611171159},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055873X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013837","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:24:11Z","timestamp":1132730651000},"page":"350-363","source":"Crossref","is-referenced-by-count":7,"title":["Axiomatizing permutation equivalence in the \u03bb-calculus"],"prefix":"10.1007","author":[{"given":"Cosimo","family":"Laneve","sequence":"first","affiliation":[]},{"given":"Ugo","family":"Montanari","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","volume-title":"PhD thesis, Computer Science","author":"M. Bednarczyk","year":"1987","unstructured":"M. Bednarczyk. Categories of asynchronous systems. PhD thesis, Computer Science, University of Sussex, Brighton, 1987."},{"key":"23_CR2","unstructured":"G. Boudol. Computational semantics of term rewriting systems. In Algebraic methods in semantics, Eds. M. Nivat and J.C. Reynolds, Cambridge University Press 1985, pp. 169\u2013236."},{"issue":"4","key":"23_CR3","doi-asserted-by":"crossref","first-page":"433","DOI":"10.3233\/FI-1988-11406","volume":"11","author":"G. Boudol","year":"1988","unstructured":"G. Boudol and I. Castellani. A non-interleaving semantics for CCS based on proved transitions. Fundamenta Informaticae, 11(4):433\u2013452, 1988.","journal-title":"Fundamenta Informaticae"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"A. Corradini and U. Montanari. An algebraic semantics for strucured transition systems and its application to logic programs. Theoretical Computer Science, 1992. in press.","DOI":"10.1016\/0304-3975(92)90087-V"},{"key":"23_CR5","unstructured":"H.B. Curry and R. Feys. Combinatory Logic, volume 1. North-Holland, 1974."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"P. Degano, J. Meseguer, and U. Montanari. Axiomatizing net computations and processes. In Proceedings 4th Annual Symposium on Logic in Computer Science, Asilomar, California, to appear in Information and Computation.","DOI":"10.1109\/LICS.1989.39172"},{"issue":"7","key":"23_CR7","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"R.M. Keller","year":"1976","unstructured":"R.M. Keller. Formal verification of parallel programs. Communications of the ACM, 19(7):371\u2013384, 1976.","journal-title":"Communications of the ACM"},{"key":"23_CR8","volume-title":"Mathematical Centre Tracts. Nr.127","author":"J.W. Klop","year":"1980","unstructured":"J.W. Klop. Combinatory Reduction Systems Mathematical Centre Tracts. Nr.127, Centre for Mathematics and Computer Science, Amsterdam, 1980."},{"key":"23_CR9","unstructured":"J.J. L\u00e9vy. Optimal reductions in the lambda-calculus. In J.P. Seldin and J.R. Hindley, editors, To H.B. Curry, Essays on Combinatory Logic, Lambda Calculus and Formalism. Academic Press, 1980."},{"key":"23_CR10","unstructured":"J.J. L\u00e9vy and G. Huet. Computations in orthogonal rewriting systems, 1. In J.L. Lassez and G. Plotkin, editors, Computational Logic, Essays in honour of A. Robinson, chapter 11. MIT Press, 1991."},{"key":"23_CR11","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0304-3975(90)90118-2","volume":"77","author":"V. Manca","year":"1990","unstructured":"V. Manca, A. Salibra, and G. Scollo. Equational type logic. Theoretical Computer Science, 77:131\u2013159, 1990.","journal-title":"Theoretical Computer Science"},{"key":"23_CR12","unstructured":"J. Meseguer. Conditional rewriting systems. Theoretical Computer Science, 1992. in press."},{"key":"23_CR13","first-page":"155","volume-title":"Petri nets are monoids: a new algebraic foundation for net theory","author":"J. Meseguer","year":"1988","unstructured":"J. Meseguer and U. Montanari. Petri nets are monoids: a new algebraic foundation for net theory. In Proceedings 3th Annual Symposium on Logic in Computer Science, Edinburgh, pages 155\u2013164, Washington, 1988. IEEE Computer Society Press."},{"key":"23_CR14","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989."},{"key":"23_CR15","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-3975(89)90050-9","volume":"64","author":"E.W. Stark","year":"1989","unstructured":"E.W. Stark. Concurrent transition systems. Theoretical Computer Science, 64:221\u2013269, 1989.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0013837.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T07:27:30Z","timestamp":1626766050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013837"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055873X"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0013837","relation":{},"subject":[]}}