{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:23Z","timestamp":1725663683514},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540512851"},{"type":"electronic","value":"9783540461845"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51285-3_47","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:51:57Z","timestamp":1330203117000},"page":"288-303","source":"Crossref","is-referenced-by-count":0,"title":["The compaction of acyclic terms"],"prefix":"10.1007","author":[{"given":"Ga\u00e9tan","family":"Hains","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"19_CR1","unstructured":"A.Aho, J.Hopcroft & J.Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974."},{"key":"19_CR2","unstructured":"P.Boizumault, PROLOG: L'implantation, Masson, 1988."},{"key":"19_CR3","unstructured":"Boyer & Moore, The sharing of structure in theorem-proving programs, in B.Meltzer and D.Michie editors, Machine Intelligence, Edinburgh Univ. Press, 101\u2013116, 1972."},{"key":"19_CR4","unstructured":"W.Brauer, On minimizing finite automata, Bulletin of the EATCS, no.35, June 1988."},{"key":"19_CR5","unstructured":"M.Cosnard & M.Tchuente, Designing systolic algorithms by top-down analysis, Third International Conference on Supercomputing, Boston, 1988."},{"issue":"4","key":"19_CR6","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/322217.322228","volume":"27","author":"P.J. Downey","year":"1980","unstructured":"P.J. Downey, R. Sethi & R.E. Tarjan, Variations on the common subexpression problem, Journal of the ACM 27, no.4, 758\u2013771, Oct. 1980.","journal-title":"Journal of the ACM"},{"key":"19_CR7","unstructured":"G.Hains, Parallel algorithms for free and associative-commutative unification, DPhil thesis, Oxford University, 1989."},{"issue":"9","key":"19_CR8","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/363219.363225","volume":"12","author":"W.J. Hansen","year":"1969","unstructured":"W.J. Hansen, Compact list representation: definition, garbage collection, and system implementation, Communications of the ACM 12, no.9, pp. 499\u2013507, Sept. 1969.","journal-title":"Communications of the ACM"},{"key":"19_CR9","unstructured":"J.E.Hopcroft & J.D.Ullman, Introduction to automata theory, languages, and computation, Addison-Wesley, 1979."},{"key":"19_CR10","unstructured":"P.C.Kanellakis & P.Z.Revesz, On the relationship of congruence closure and unification, Brown Univ., Comp.Sc. Report no. CS-87-27, Nov. 1987."},{"key":"19_CR11","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0022-0000(78)90043-0","volume":"16","author":"M.S. Paterson","year":"1978","unstructured":"M.S. Paterson & M.N. Wegman, Linear unification, Journal of Computer and Systems Sciences 16, 158\u2013167, 1978.","journal-title":"Journal of Computer and Systems Sciences"},{"key":"19_CR12","unstructured":"S.L.Peyton Jones, The Implementation of Functional Programming Languages, Prentice-Hall, 1987."},{"key":"19_CR13","unstructured":"T.A.Standish, Data Structure Techniques, Addison-Wesley, 1980."}],"container-title":["Lecture Notes in Computer Science","PARLE '89 Parallel Architectures and Languages Europe"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51285-3_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:02:30Z","timestamp":1619571750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51285-3_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540512851","9783540461845"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-51285-3_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}