{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:50:25Z","timestamp":1725663025978},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540183174"},{"type":"electronic","value":"9783540478799"}],"license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18317-5_13","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:32:51Z","timestamp":1330198371000},"page":"212-233","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A theory for natural modelisation and implementation of functions with variable arity"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Bellot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00e9ronique","family":"Jay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/MC.1982.1653940","volume":"15","author":"Arvind, K. K. P. P. Gostelow","year":"1982","unstructured":"Arvind, K.P. Gostelow The U-interpreter. IEEE Computer. vol. 15, pp. 42\u201349, Feb. 1982.","journal-title":"IEEE Computer"},{"issue":"8","key":"13_CR2","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","volume":"1","author":"J. W. Backus","year":"1978","unstructured":"J.W. Backus Can Programming be liberated from the Von Neumann style? A functional style and its Algebra of Programs, CACM Vol. 1, no 8, pp 613\u2013641, 1978.","journal-title":"CACM"},{"key":"13_CR3","unstructured":"H.P. Barendregt The Lambda-Calculus, its syntax and semantics, Studies in Logic and the Foundations of Mathematics, Vol. 103, North Holland, 1981."},{"key":"13_CR4","unstructured":"A. Belkhir Programmation Fonctionnelle et Parall\u00e8lisme, Rapport Gr\u00e9co de Programmation 1986."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"P. Bellot Graal: a functional programming system with uncurryfied combinators and its reduction machine. ESOP 86, LNCS 213, B. Robinet ed., pp. 82\u201398, Saarbrucken, 1986.","DOI":"10.1007\/3-540-16442-1_6"},{"key":"13_CR6","unstructured":"P. Bellot Sur les sentiers du Graal, \u00e9tude, conception et r\u00e9alisation d'un langage de programmation sans variable. Th\u00e8se d'Etat, UPMC Paris 6, Rapport LITP 86-62, 1986."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"P. Bellot Proposal for a natural formalization of functional programming concepts, submitted to publication at RAIRO, 1987.","DOI":"10.1051\/ita\/1988220303411"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"L. Cardelli Compiling a Functional Language, 1984 ACM Symposium on Lisp and Functional Programming, Austin, Texas, 1984.","DOI":"10.1145\/800055.802037"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"J. Chailloux, M. Devin, J-M. Hullot Lelisp, a portable and efficient Lisp system, 1984 ACM Symposium on Lisp and Functional Programming, Austin, Texas, 1984.","DOI":"10.1145\/800055.802027"},{"key":"13_CR10","series-title":"LNCS","first-page":"85","volume-title":"13th Spring School of the LITP","author":"G. Cousineau","year":"1985","unstructured":"G. Cousineau, P-L. Curien, M. Mauny, A. Su\u00e0rez Combinateurs Cat\u00e9goriques et Impl\u00e9mentation des languages fonctionnels, 13th Spring School of the LITP, LNCS. 242. G. Cousineau, P-L. Curien, B. Robinet ed., pp. 85\u2013103. Val d'Ajol, France, 1985."},{"key":"13_CR11","unstructured":"H.B. Curry, R. Feys Combinatory Logic Vol I, North Holland, 1958."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"N.J. Cutland Computability, an introduction to recursive function theory, Cambridge University Press, 1980.","DOI":"10.1017\/CBO9781139171496"},{"key":"13_CR13","unstructured":"J.B. Dennis The varieties of DataFlow computers, IEEE Int. Conf. on Distributed Systems, 1979."},{"key":"13_CR14","unstructured":"H. Glaser, C. Hankin, D. Till Principles of Functional Programming. Prentice\/Hall International, 1984."},{"key":"13_CR15","unstructured":"K. Godel Uber formal unentscheidbare Satze des Principia Mathematica und verwandter System I, english translation in M. Davis, The undecidable, Raven N.Y. 1965."},{"key":"13_CR16","unstructured":"J.R. Hindley, J.P. Seldin Introduction to Combinators and Lambda-Calculus. London Mathematical Society, Student Texts 1, Cambridge University Press, 1986."},{"key":"13_CR17","unstructured":"J.W. Klop Combinatory Reduction Systems, Ph.D. Thesis, University of Amsterdam, 1980."},{"key":"13_CR18","unstructured":"E. Mendelson Introduction to Mathematical Logic, Van Nostrand, 2nd ed., 1979."},{"key":"13_CR19","unstructured":"The ML handbook, Rapport Inria, 1984."},{"key":"13_CR20","unstructured":"B. Robinet Combinateurs r\u00e9currents et it\u00e9rateurs de Church, Rapport LITP 82-1, 1982."},{"key":"13_CR21","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"H. Rogers Theory of Recursive Functions and Effective Computability, McGraw Hill, N.Y., 1967."},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"H.R. Strong Algebraically generalized recursive function theory, IBM Journal for Research and Development, nov. 1968.","DOI":"10.1147\/rd.126.0465"},{"key":"13_CR23","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"D. A. Turner","year":"1979","unstructured":"D.A. Turner A new implementation technique for applicative language, Software-Practice and Experience, Vol. 9, pp. 31\u201349, 1979.","journal-title":"Software-Practice and Experience"}],"container-title":["Lecture Notes in Computer Science","Functional Programming Languages and Computer Architecture"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18317-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T02:07:56Z","timestamp":1640916476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18317-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540183174","9783540478799"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-18317-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]},"assertion":[{"value":"27 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}