{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:18Z","timestamp":1761611298895},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540164425"},{"type":"electronic","value":"9783540397823"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16442-1_7","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:41:01Z","timestamp":1330195261000},"page":"99-110","source":"Crossref","is-referenced-by-count":9,"title":["A safe approach to parallel combinator reduction (extended abstract)"],"prefix":"10.1007","author":[{"given":"Chris L.","family":"Hankin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geoffrey L.","family":"Burn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon L.","family":"Peyton Jones","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"7_CR1","unstructured":"Abramsky, S., Abstract Interpretation, Logical Relations and Kan Extensions, Draft Manuscript, 1985."},{"key":"7_CR2","unstructured":"Burn, G.L., Hankin, C.L., and Abramsky, S., Strictness Analysis for Higher-Order Functions, To appear in Science of Computer Programming Also: Imperial College of Science and Technology, Department of Computing, Research Report DoC 85\/6, April 1985."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Hankin, C.L., Osmon, P.E., and Shute, M.J., COBWEB: A Combinator Reduction Architecture, in: Proceedings of IFIP International Conference on Functional Programming Languages and Computer Architecture, Nancy, France, 16\u201319 September, 1985, Jouannaud, J.-P. (ed.), Springer-Verlag LNCS 201, pp. 99\u2013112.","DOI":"10.1007\/3-540-15975-4_32"},{"key":"7_CR4","unstructured":"Hughes, J., The Design and Implementation of Programming Languages, PhD Thesis, Oxford University, 1983. (Published as Oxford University Computing Laboratory, Programming Research Group, Technical Monograph PRG-40, September, 1984.)"},{"key":"7_CR5","unstructured":"Hughes, J., Strictness Detection in Non-Flat Domains Workshop on Programs as Data Objects, Copenhagen, Denmark, 17\u201319 October, 1985. (Proceedings to be published in Springer Verlag LNCS series.)"},{"issue":"3","key":"7_CR6","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0096-0551(85)90017-7","volume":"10","author":"M. S. Joy","year":"1985","unstructured":"Joy, M.S., Rayward-Smith, V.J. and Burton, F.W., Efficient Combinator Code, Computer Languages 10 3, 1985, pp.211\u2013223.","journal-title":"Computer Languages"},{"key":"7_CR7","unstructured":"Kennaway, J.R., and Sleep, M.R., Director Strings as Combinators, University of East Anglia Report, 1981."},{"key":"7_CR8","unstructured":"Maurer, D., Strictness Computation Using Generalised \u03bb-expressions, Workshop on Programs as Data Objects, Copenhagen, Denmark, 17\u201319 October, 1985. (Proceedings to be published in Springer Verlag LNCS series.)"},{"key":"7_CR9","unstructured":"Meira, S.R. de L., On the Efficiency of Applicative Algorithms, PhD Thesis, The University of Kent at Canterbury, March 1985."},{"key":"7_CR10","unstructured":"Mycroft, A., Abstract Interpretation and Optimising Transformations for Applicative Programs, PhD. Thesis, University of Edinburgh, 1981."},{"key":"7_CR11","unstructured":"Oberhauser, H.-G., Wilhelm, R., Flow Analysis in Combinator Implementation of Functional Programming Languages, Technical Report, Universitat des Saarlandes, D-6600 Saarbrucken, 1984."},{"key":"7_CR12","unstructured":"Scott, D., Lectures on a Mathematical Theory of Computation, Tech. Monograph PRG-19, Oxford Univ. Computing Lab., Programming Research Group, 1981."},{"issue":"2","key":"7_CR13","doi-asserted-by":"crossref","first-page":"267","DOI":"10.2307\/2273733","volume":"44","author":"D. A. Turner","year":"1979","unstructured":"Turner, D.A., Another Algorithm For Bracket Abstraction, The Journal of Symbolic Logic 44 2, June 1979, pp. 267\u2013270.","journal-title":"The Journal of Symbolic Logic"},{"key":"7_CR14","unstructured":"Wadler, P., Strictness Analysis on Non-Flat Domains (by Abstract Interpretation over Finite Domains), Draft Manuscript, 1985."}],"container-title":["Lecture Notes in Computer Science","ESOP 86"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16442-1_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:03:35Z","timestamp":1619557415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16442-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540164425","9783540397823"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-16442-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}