{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:34Z","timestamp":1725663454004},"publisher-location":"Berlin, Heidelberg","reference-count":8,"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_6","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:40:44Z","timestamp":1330177244000},"page":"82-98","source":"Crossref","is-referenced-by-count":7,"title":["Graal : A Functional Programming system with uncurryfied combinators and its reduction machine"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Bellot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"J.W. Backus Can programming be liberated from Von Neumann style? A functional style and its Algebra of programs., CACM 21, Volume 8, 1978.","DOI":"10.1145\/359576.359579"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"F. Bellegarde Rewriting systems on FP expressions that reduce the number sequences they yield, Symposium on Lisp and Functional Programming 1984, LNCS, pp 63\u201373, Austin (Texas), 1984.","DOI":"10.1145\/800055.802022"},{"key":"6_CR3","unstructured":"P. Bellot JYM: un language de programmation sans variables et ses r\u00e9alisations, Actes des journ\u00e9es Afcet-Groplan, Bulletin BIGRE+GLOBULE, J. Andr\u00e9 \u00e9diteur, \u00e0 paraftre, Toulouse 1985."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"P. Bellot High order programming in extended FP, IFIP conference on Functional Programming and Computer Architecture, LNCS 201, pp 65\u201380, Nancy 1985.","DOI":"10.1007\/3-540-15975-4_30"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"P. Bellot and B. Robinet Functional programming with uncurryfied combinators, First Workshop on Reduction Machines, to appear in LNCS, Ustica (Italy), 1985.","DOI":"10.1007\/3-540-16442-1_6"},{"key":"6_CR6","volume-title":"Compiling a functional language","author":"L. Cardelli","year":"1984","unstructured":"L. Cardelli Compiling a functional language, Symposium on Lisp and Functional Programming 1984, LNCS, Austin (Texas) 1984."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"G. Cousineau, PL. Curien and M. Mauny The categorical abstract machine, IFIP conference on Functional Programming and Computer Architecture, LNCS 201, pp 50\u201364, Nancy 1985.","DOI":"10.1007\/3-540-15975-4_29"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"J.H. Williams Formal representation of recursively defined functional programs, Formalization of programming concepts, LNCS 107, Penniscola 1981.","DOI":"10.1007\/3-540-10699-5_119"}],"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_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:10:08Z","timestamp":1605625808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16442-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540164425","9783540397823"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-16442-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}