{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:41:16Z","timestamp":1725457276518},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633983"},{"type":"electronic","value":"9783540695370"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0033834","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T02:27:37Z","timestamp":1134268057000},"page":"17-31","source":"Crossref","is-referenced-by-count":0,"title":["An object calculus with algebraic rewriting"],"prefix":"10.1007","author":[{"given":"Adriana","family":"Compagnoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maribel","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,21]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi and L. Cardelli. A theory of primitive objects. Untyped and first-order systems. In Theoretical Aspects of Computer Software, pages 296\u2013320. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-57887-0_101"},{"issue":"2","key":"2_CR2","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1006\/inco.1996.0024","volume":"125","author":"M. Abadi","year":"1996","unstructured":"M. Abadi and L. Cardelli. A theory of primitive objects. Untyped and first-order systems. Information and Computation, 125(2):78\u2013102, 1996.","journal-title":"Information and Computation"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Val Breazu-Tannen and Jean Gallier. Polymorphic rewriting conserves algebraic strong normalization. Theoretical Computer Science, 83(1), 1991.","DOI":"10.1016\/0304-3975(91)90037-3"},{"key":"2_CR4","first-page":"3","volume":"82","author":"V. Breazu-Tannen","year":"1992","unstructured":"Val Breazu-Tannen and Jean Gallier. Polymorphic rewriting conserves algebraic confluence. Information and Computation, 82:3\u201328, 1992.","journal-title":"Information and Computation"},{"key":"2_CR5","volume-title":"Proc. 23rd ACM Symposium on Principles of Programming Languages","author":"A. Gordon","year":"1996","unstructured":"A. Gordon and G. Rees. Bisimilarity for a first-order calculus of objects with subtyping. In Proc. 23rd ACM Symposium on Principles of Programming Languages, St. Petersburg Beach, Florida, 1996."},{"issue":"1","key":"2_CR6","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/138027.138060","volume":"40","author":"R. Harper","year":"1993","unstructured":"R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. Journal of the ACM, 40(1):143\u2013184, 1993.","journal-title":"Journal of the ACM"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"J.-P. Jouannaud and M. Okada. Executable higher-order algebraic specification languages. In Proc. 6th Annual IEEE Symposium on Logic in Computer Science, pages 350\u2013361, 1991.","DOI":"10.1109\/LICS.1991.151659"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"J. McKinna and R. Pollack. Pure type systems formalized. In J-F Groote and M Bezem, editors, Proc. of the International Conference on Typed Lambda Calculi and Applications, volume 664 of Lecture Notes in Computer Science. Springer-Verlag, 1993.","DOI":"10.1007\/BFb0037113"},{"issue":"1","key":"2_CR9","first-page":"3","volume":"1","author":"J. Mitchell","year":"1994","unstructured":"J. Mitchell, F. Honsell, and K. Fisher. A lambda calculus of objects and method specialization. Nordic Journal of Computing, 1(1):3\u201337, 1994.","journal-title":"Nordic Journal of Computing"},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0020-0190(92)90155-O","volume":"41","author":"F. M\u00fcller","year":"1992","unstructured":"F. M\u00fcller. Confluence of the lambda-calculus with left-linear algebraic rewriting. Information Processing Letters, 41:293\u2013299, 1992.","journal-title":"Information Processing Letters"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"J. Palsberg. Efficient inference of object types. In Proc. 9th Annual IEEE Symposium on Logic in Computer Science, Paris, France, 1994.","DOI":"10.1109\/LICS.1994.316073"},{"key":"2_CR12","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/321738.321750","volume":"20","author":"B. K. Rosen","year":"1973","unstructured":"B. K. Rosen. Tree-manipulating systems and Church-Rosser theorems. Journal of the ACM, 20:160\u2013187, 1973.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Programming Languages: Implementations, Logics, and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0033834","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T05:03:09Z","timestamp":1554872589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0033834"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633983","9783540695370"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0033834","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}