{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:12Z","timestamp":1725663372124},"publisher-location":"Berlin, Heidelberg","reference-count":18,"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_25","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:00:12Z","timestamp":1330192812000},"page":"23-34","source":"Crossref","is-referenced-by-count":0,"title":["Semantiques comparees des systemes de programmation fonctionnelle FP et FFP de J.W. Backus"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Bellot","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"issue":"8","key":"3_CR1","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J. W. Backus","year":"1978","unstructured":"J.W. BACKUS, Can programming be liberated from the Von Neumann style? dans CACM, Vol 21, No 8, pp 613\u2013641, 1978","journal-title":"dans CACM"},{"key":"3_CR2","unstructured":"J.W. BACKUS, Reduction languages and variable-free programming, dans IBM Research report, RJ 1010, 1972"},{"key":"3_CR3","unstructured":"H.P. BARENDREGT, Normed Uniformly Reflexives Structures, dans Notes on Logic and computer sciences, LOCOS 24, Janvier 1975"},{"key":"3_CR4","unstructured":"H.P. BARENDREGT, The lambda-calculus, North Holland Pub. V103"},{"key":"3_CR5","unstructured":"P. BELLOT, Syst\u00e8mes de programmation sans variables, Compterendus de l'Acad\u00e9mie des Sciences, I 274"},{"key":"3_CR6","unstructured":"P. BELLOT, Propri\u00e9t\u00e9s Logico-Combinatoire des syst\u00e8mes de programmation sans variables, Th\u00e8se de 3\u00e8me cycle, dec. 1983"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"C. BOEHM, Combinatory foundations of functional programming, ACM, Symposium on Lisp and functional programming, 1982","DOI":"10.1145\/800068.802132"},{"key":"3_CR8","unstructured":"H.B. CURRY, Combinatory Logic Vol. I, North Holland, 1958"},{"key":"3_CR9","unstructured":"S.C. KLEENE, Introduction to meta-mathematics, Van Nostrand NY"},{"key":"3_CR10","first-page":"33","volume-title":"A basis for mathematical theory of computer sciences, computer programming and formal system","author":"J. Mac Carthy","year":"1963","unstructured":"J. Mac CARTHY, A basis for mathematical theory of computer sciences, computer programming and formal system, Bradford & Hircshing, North Holland 1963, pp 33\u201370"},{"key":"3_CR11","unstructured":"J.F. PERROT, Lisp et lambda-calcul, dans Lambda-calcul et semantique formelle des langages de programmation, Actes de la 6\u00e8me \u00e9cole de printemps d'informatique th\u00e9orique, Litp-Ensta 1978"},{"key":"3_CR12","unstructured":"B. ROBINET, Un mod\u00e8le Logico-combinatoire des syst\u00e8mes de Backus Publications Litp 80-21, 1980"},{"key":"3_CR13","unstructured":"B. ROBINET, Programmation sans variables ou la Logique Combinatoire \u00e0 la Backus, Grosplan Afcet, Cargese 1979"},{"key":"3_CR14","unstructured":"H. ROGERS, Theory of recursive functions and effective computability, 1967, Mac Graw Hill"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"H.R. STRONG, Algeabrically generalized recursive function theory IBM J. of Research and development, 1968, pp 465\u2013475","DOI":"10.1147\/rd.126.0465"},{"key":"3_CR16","unstructured":"E.G. WAGNER, URS: an axiomatic approach to computability, Information sciences, vol I, 1968"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"E.G. WAGNER, URS: on the nature of Godelisation and relative computability, Trans. Amer. Math. Society 1969, pp 1\u201341","DOI":"10.1090\/S0002-9947-1969-0249297-9"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"J.H. WILLIAMS, Formal representations of recursively defined functional programs, Proc. Penniscola 1981, pp 460\u2013470","DOI":"10.1007\/3-540-10699-5_119"}],"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_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:06:51Z","timestamp":1605643611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12925-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540129257","9783540388098"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-12925-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}