{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:42Z","timestamp":1725662862696},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540129257"},{"type":"electronic","value":"9783540388098"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-12925-1_40","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:00:24Z","timestamp":1330192824000},"page":"206-216","source":"Crossref","is-referenced-by-count":2,"title":["Optimized combinatoric code for applicative language implementation"],"prefix":"10.1007","author":[{"given":"Silvio Lemos","family":"Meira","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"issue":"8","key":"18_CR1","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J. Backus","year":"1978","unstructured":"Backus, J., Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs, Comm. ACM 21, 8 (Aug. 1978), 613\u2013641.","journal-title":"Comm. ACM"},{"issue":"5","key":"18_CR2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(82)90014-X","volume":"14","author":"F. W. Burton","year":"1982","unstructured":"Burton, F. W., A Linear Space Translation of Functional Programs to Turner Combinators, Inf. Proc. Lett. 14, 5 (Jul. 1982), 201\u2013204.","journal-title":"Inf. Proc. Lett."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Cousot, P. and Cousot, R., Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixed Points, in Proc. 4th. ACM Symp. on Princ. Prog. Lang., ACM, Los Angeles, 1977.","DOI":"10.1145\/512950.512973"},{"key":"18_CR4","unstructured":"Curry, H. B., Feys, R. and Craig, W., Combinatory Logic, Vol. I, North Holland, Amsterdam, 1958."},{"key":"18_CR5","unstructured":"Friedman, D. P. and Wise, D. S., CONS Should not Evaluate its Arguments, in 3rd. Intl. Coll. in Autom. Lang. & Programming, Edinburgh, Jul. 1976, 257\u2013284."},{"key":"18_CR6","volume-title":"Edinburgh LCF, CSR-11-77, Parts I and II","author":"M. Gordon","year":"1977","unstructured":"Gordon, M., Milner, R. and Wadsworth, C., Edinburgh LCF, CSR-11-77, Parts I and II, Dep. Comp. Sci, University of Edinburgh, Edinburgh, Scotland, 1977."},{"key":"18_CR7","first-page":"1","volume-title":"Conf. Record of the 1982 ACM Symp on LISP and Funct. Prog.","author":"R. J. M. M. Hughes","year":"1982","unstructured":"Hughes, R. J. M., Super Combinators: A New Implementation Method for Applicative Languages, in Conf. Record of the 1982 ACM Symp on LISP and Funct. Prog., ACM, Pittsburgh, PA, 15\u201318 Aug. 1982, 1\u201310."},{"key":"18_CR8","first-page":"11","volume-title":"Conf. Record of the 1982 ACM Symp on LISP and Funct. Prog.","author":"N. D. Jones","year":"1982","unstructured":"Jones, N. D. and Muchnick, S. S., A Fixed-Program Machine for Combinator Expression Evaluation, in Conf. Record of the 1982 ACM Symp on LISP and Funct. Prog., ACM, Pittsburgh, PA, 15\u201318 Aug. 1982, 11\u201320."},{"key":"18_CR9","volume-title":"Flow Analysis of Lambda Expressions, DAIMI PB-128","author":"N. D. Jones","year":"1981","unstructured":"Jones, N. D., Flow Analysis of Lambda Expressions, DAIMI PB-128, Comp. Sci. Dept., Aarhus Univ., Aarhus, Denmark, Jan. 1981."},{"key":"18_CR10","unstructured":"Meira, S., The Kent Recursive Calculator (KRC): Syntax and Semantics, unpublished, Canterbury, U. K., 1983."},{"key":"18_CR11","volume-title":"Abstract Interpretation Methods for Optimization of Combinatoric Code","author":"S. Meira","year":"1983","unstructured":"Meira, S., Abstract Interpretation Methods for Optimization of Combinatoric Code, in preparation, Computing Laboratory, University of Kent, Canterbury, U. K., 1983."},{"key":"18_CR12","volume-title":"Abstract Interpretation and Optimising Transformations for Applicative Programs","author":"A. Mycroft","year":"1981","unstructured":"Mycroft, A., Abstract Interpretation and Optimising Transformations for Applicative Programs, Ph. D. Thesis, Dep. of Comp. Sci., Univ. of Edinburgh, Edinburgh, 1981."},{"issue":"3","key":"18_CR13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF00263194","volume":"18","author":"F. Nielson","year":"1982","unstructured":"Nielson, F., A Denotational Framework for Data Flow Analysis, Acta Informatica 18, 3 (1982), 265\u2013288.","journal-title":"Acta Informatica"},{"key":"18_CR14","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/3-540-08921-7_89","volume-title":"Math. Found. of Comp. Sci. 1978","author":"A. Pettorossi","year":"1978","unstructured":"Pettorossi, A., Improving Memory utilization in Transforming Recursive Programs, in Math. Found. of Comp. Sci. 1978, J. Winkowski, ed., Springe Verlag, Zakopane, Poland, 1978, 416\u2013425."},{"key":"18_CR15","volume-title":"From Frege to Godel \u2014 A Source Book in Mathematical Logic, 1879\u20131931","author":"M. Schonfinkel","year":"1977","unstructured":"Schonfinkel, M., On The Building Blocks of Mathematical Logic, in From Frege to Godel \u2014 A Source Book in Mathematical Logic, 1879\u20131931, J. van Heijenoort, ed., Harvard Univ. Press, Cambridge, Mass, 1977."},{"key":"18_CR16","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"D. A. Turner","year":"1979","unstructured":"Turner, D. A., A New Implementation Technique for Applicative Languages, Soft. Pract. and Exp. 9, (1979), 31\u201349.","journal-title":"Soft. Pract. and Exp."},{"key":"18_CR17","volume-title":"SASL Language Manual","author":"D. A. Turner","year":"1979","unstructured":"Turner, D. A., SASL Language Manual, Comp. Lab. Report, University of Kent, Canterbury, 1979."},{"key":"18_CR18","volume-title":"Functional Programming and its Applications, An Advanced Course","author":"D. A. Turner","year":"1982","unstructured":"Turner, D. A., Recursion Equations as a Programming Language, in Functional Programming and its Applications, An Advanced Course, C. U. P., Cambridge, UK, 1982."},{"issue":"2","key":"18_CR19","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, J. Sym. Log. 44, 2 (Jun. 1979), 267\u2013270.","journal-title":"J. Sym. Log."}],"container-title":["Lecture Notes in Computer Science","International Symposium on Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-12925-1_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:06:56Z","timestamp":1605643616000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12925-1_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540129257","9783540388098"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-12925-1_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}