{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T06:42:49Z","timestamp":1750488169528},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540676683"},{"type":"electronic","value":"9783540450993"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/978-3-540-45099-3_6","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T09:05:17Z","timestamp":1294995917000},"page":"95-114","source":"Crossref","is-referenced-by-count":5,"title":["Safety of Strictness Analysis via Term Graph Rewriting"],"prefix":"10.1007","author":[{"given":"David","family":"Clark","sequence":"first","affiliation":[]},{"given":"Chris","family":"Hankin","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Hunt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Abramsky, S., Hankin, C.L. (eds.): Abstract Interpretation of Declarative Languages. Computers and Their Applications. Ellis Horwood (1987)"},{"issue":"3,4","key":"6_CR2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.3233\/FI-1996-263401","volume":"26","author":"Z. Ariola","year":"1996","unstructured":"Ariola, Z., Klop, J.W.: Equational term graph rewriting. Fundamentae Informatica\u00a026(3,4), 207\u2013240 (1996)","journal-title":"Fundamentae Informatica"},{"issue":"1-2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(94)00185-L","volume":"146","author":"Z. Ariola","year":"1995","unstructured":"Ariola, Z., Arvind: Properties of a first-order functional language with sharing. Theoretical Computer Science\u00a0146(1-2), 69\u2013108 (1995)","journal-title":"Theoretical Computer Science"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Ariola, Z., Blom, S.: Cyclic lambda calculi. In: Ito, T., Abadi, M. (eds.) TACS 1997. LNCS, vol.\u00a01281. Springer, Heidelberg (1997)","DOI":"10.1007\/BFb0014548"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-17945-3_8","volume-title":"PARLE Parallel Architectures and Languages Europe","author":"H.P. Barendregt","year":"1987","unstructured":"Barendregt, H.P., van Eekelen, M.C.J.D., Glauert, J.R.W., Kennaway, J.R., Plasmeijer, M.J., Sleep, M.R.: Term graph rewriting. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol.\u00a0259, pp. 141\u2013158. Springer, Heidelberg (1987)"},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1017\/S0960129500070109","volume":"6","author":"E. Barendsen","year":"1996","unstructured":"Barendsen, E., Smetsers, S.: Uniqueness typing for functional languages with graph rewriting semantics. Mathematical Structures in Computer Science\u00a06, 579\u2013612 (1996)","journal-title":"Mathematical Structures in Computer Science"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Chuang, T.-R., Goldberg, B.: A syntactic approach to fixed point computation on finite domains. In: Proc. 1992 ACM Conference on LISP and Functional Programming. ACM, New York (1992)","DOI":"10.1145\/141471.141517"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-57186-8_88","volume-title":"Programming Language Implementation and Logic Programming","author":"D.J. Clark","year":"1993","unstructured":"Clark, D.J., Hankin, C.: A lattice of abstract graphs. In: Penjam, J., Bruynooghe, M. (eds.) PLILP 1993. LNCS, vol.\u00a0714, pp. 318\u2013331. Springer, Heidelberg (1993)"},{"key":"6_CR9","unstructured":"Clark, D.J.: Term Graph Rewriting and Event Structures. PhD thesis, Imperial College, University of London (1996)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixed points. In: Proc. Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"6_CR11","unstructured":"Gordon, A.D., Pitts, A.M. (eds.): Higher Order Operational Techniques in Semantics. Publications of the Newton Institute. Cambridge University Press (1998)"},{"key":"6_CR12","first-page":"131","volume-title":"Term Graph Rewriting, theory and practice","author":"E. Goubault","year":"1993","unstructured":"Goubault, E., Hankin, C.L.: A lattice for the abstract interpretation of term graph rewriting systems. In: Term Graph Rewriting, theory and practice, pp. 131\u2013140. John Wiley and Sons Ltd, Chichester (1993)"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1006\/jsco.1996.0002","volume":"21","author":"J.R. Kennaway","year":"1996","unstructured":"Kennaway, J.R., Klop, J.W., Sleep, M.R., de Vries, F.J.: Comparing curried and uncurried rewriting. J. Symbolic Computation\u00a021, 15\u201339 (1996)","journal-title":"J. Symbolic Computation"},{"key":"6_CR14","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"J.W. Klop","year":"1992","unstructured":"Klop, J.W.: Term rewriting systems. In: Abramsky, S., Gabbay, D.M., Maibaum, T. (eds.) Handbook of Logic in Computer Science, vol.\u00a02, pp. 1\u2013116. Oxford University Press, New York (1992)"},{"key":"6_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"F. Nielson","year":"1999","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.L.: Principles of Program Analysis. Springer, Heidelberg (1999)"},{"key":"6_CR16","unstructured":"N\u00f6cker, E.: Strictness analysis based on abstract reduction of term graph rewrite systems. In: Proc. Workshop on Implementation of Lazy Functional Languages (1988)"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"N\u00f6cker, E.: Strictness analysis using abstract reduction. In: Proc. Conference on Functional Programming Languages and Computer Architectures (FPCA 1993), Copenhagen. ACM Press, New York (1993)","DOI":"10.1145\/165180.165219"},{"key":"6_CR18","unstructured":"N\u00f6cker, E.: Efficient Functional Programming. PhD thesis, Department of Computer Science, University of Nijmegen, Toernooiveld 1, 6525 ED Nijmegen, The Netherlands (1994)"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Sands, D., Moran, A.: Improvement in a lazy context: an operational theory for call-by-need. In: Proc. Twenty-sixth ACM Symposium on Principles of Programming Languages, San Antonio, Texas (January 1999)","DOI":"10.1145\/292540.292547"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Sch\u00fctz, M., Schmidt-Schau\u00df, M., Panitz, S.E.: Strictness analysis by abstract reduction using a tableau calculus. In: Mycroft, A. (ed.) SAS 1995. LNCS, vol.\u00a0983, pp. 348\u2013365. Springer, Heidelberg (1995)","DOI":"10.1007\/3-540-60360-3_49"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Turner, D.N., Wadler, P., Mossin, C.: Once upon a type. In: Proc. 7th International Conference on Functional Programming and Computer Architecture, San Diego, California (June 1995)","DOI":"10.1145\/224164.224168"},{"key":"6_CR22","unstructured":"van Eekelen, M.C.J., Goubault, E., Hankin, C.L., N\u00f6cker, E.: Abstract reduction: Towards a theory via abstract interpretation. In: Term Graph Rewriting, theory and practice, pp. 117\u2013130. John Wiley and Sons Ltd, Chichester (1993)"},{"key":"6_CR23","unstructured":"van Oostrom, V.: Confluence for Abstract and Higher-Order Rewriting. PhD thesis, Vrije Universiteit, Amsterdam (1994)"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Wansbrough, K., Jones, S.P.: Once upon a polymorphic type. In: Proc. Twenty-sixth ACM Symposium on Principles of Programming Languages, San Antonio, Texas (January 1999)","DOI":"10.1145\/292540.292545"},{"issue":"1","key":"6_CR25","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1006\/inco.1994.1093","volume":"115","author":"A.K. Wright","year":"1994","unstructured":"Wright, A.K., Felleisen, M.: A syntactic approach to type soundness. Information and Computation\u00a0115(1), 38\u201394 (1994)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45099-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,15]],"date-time":"2020-06-15T16:21:09Z","timestamp":1592238069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45099-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676683","9783540450993"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45099-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}