{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:36:53Z","timestamp":1648867013887},"reference-count":11,"publisher":"EDP Sciences","issue":"R3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["R.A.I.R.O. Informatique th\u00e9orique"],"published-print":{"date-parts":[[1975]]},"DOI":"10.1051\/ita\/197509r300251","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T15:30:35Z","timestamp":1486395035000},"page":"25-49","source":"Crossref","is-referenced-by-count":2,"title":["Note sur l'alg\u00e8bre des fonctions"],"prefix":"10.1051","volume":"9","author":[{"given":"F. H.","family":"Raymond","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"ARSAC J., Les langages sans \u00e9tiquettes. Publication 73\/13. Institut de Programmation. Universit\u00e9 de Paris VI.0291.68030"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"BOHM C. et JACOPINI G., Flow diagrams, Turing machines and languages with only two formation rules, Comm. ACM, may 1966, vol. 9, n\u00b0 5, 366-371.0145.24204","DOI":"10.1145\/355592.365646"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"CADIOU J., Recursive definitions of partial functions and their conditions. Ph D, thesis. Computer Science department, Stanford University. June 1972.","DOI":"10.1145\/800235.807072"},{"key":"R4","unstructured":"KLEENE S. C., Introduction to Metamathematics (the r\u00e9cursion theorem, p. 348). Van Nostrand, 1952.0047.00703"},{"key":"R5","unstructured":"KOTT J., Remarques sur la structure des sch\u00e9mas de programme, in Th\u00e9orie des automates, des langages et de la programmation, Colloques IRIA, 1972, pp. 191-194.0262.68005"},{"key":"R6","unstructured":"MALCEV A. L., Algorithms and recursive functions, Wolters-Noardhoff Publishing Corp. Netherlands, 1970.0198.02501"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"MILLS H. D., The new Math of Computer Programming. Com. ACM, January 1975, vol. 18, n\u00b0 1, pp. 43-48.0293.68013","DOI":"10.1145\/360569.360659"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"PRATHER R. E., A convenient Cryptomorphic Version of Recursive Function Theory in Information and Control, vol. 27, n\u00b0 2, February 1975, pp. 178-195.0306.02031","DOI":"10.1016\/S0019-9958(75)90127-8"},{"key":"R9","unstructured":"RAYMOND F. H., Tentative de formalisation en informatique, in Structure et programmation des calculateurs, S\u00e9minaires IRIA, 1972, pp. 201-248."},{"key":"R10","unstructured":"Et : Formalisation du concept de calcul. Publications 25 et 32, 1972-1973, Institut de Programmation, Universit\u00e9 Paris VI."},{"key":"R11","unstructured":"RAYMOND F. H. Alg\u00e8bre des fonctions. Cours du CNAM. \u00c9ditions Scientifiques Riber, Paris, 1974."}],"container-title":["Revue fran\u00e7aise d'automatique informatique recherche op\u00e9rationnelle. Informatique th\u00e9orique"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/197509R300251\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T09:32:55Z","timestamp":1568799175000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/197509R300251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"references-count":11,"journal-issue":{"issue":"R3"},"alternative-id":["ita197509R300251"],"URL":"https:\/\/doi.org\/10.1051\/ita\/197509r300251","relation":{},"ISSN":["0397-9326"],"issn-type":[{"value":"0397-9326","type":"print"}],"subject":[],"published":{"date-parts":[[1975]]}}}