@article{ITA_1978__12_4_339_0,
author = {Canal, Richard},
title = {Complexit\'e de la r\'eduction en logique combinatoire},
journal = {RAIRO. Informatique th\'eorique},
pages = {339--367},
year = {1978},
publisher = {EDP Sciences},
volume = {12},
number = {4},
mrnumber = {517635},
zbl = {0432.03012},
language = {fr},
url = {https://www.numdam.org/item/ITA_1978__12_4_339_0/}
}
Canal, Richard. Complexité de la réduction en logique combinatoire. RAIRO. Informatique théorique, Tome 12 (1978) no. 4, pp. 339-367. https://www.numdam.org/item/ITA_1978__12_4_339_0/
1., Abstract Computational Complexity and Cycling Computations, J.C.S.S., vol. 5, 1971, p. 118-128. | Zbl | MR
2., Computational Complexity. Main Results and a Commentary, Seminaire I.R.I.A., 1972.
3., Complessita di Calcolo delleFunzioni. Boringhieri, Ed., 1975.
4. et , On Subrecursiveness in Weak Combinatory Logic, in λ Calculus and Computer Science Theory, Proceedings of the Symposium held in Rome, C. Bohm, Ed., Springer Verlag, 1975, p. 288-297. | Zbl | MR
5., A Machine Independent Theory of the Complexity of Recursive Functions, J.A.C.M., vol. 14, n° 2, 1967, p. 322-336. | Zbl | MR
6.et, λ-Terms as Total or Partial Functions on Normal Forms, in λ-Calculus and Computer Science Theory, Proceedings of the Symposium held in Rome, C. Bohm, Ed., Springer Verlag, 1975, p. 96-121. | Zbl | MR
7. et , Combinatorial Problems, Combinator Equations and Normal Forms, in Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, J. Loeckx, Ed., Springer Verlag, 1974, p. 185-199. | Zbl | MR
8., et, Terminations Tests inside λ-Calculus, in Automata, Languages and Programming, Fourth Colloquium, University of Turku, A. Salomaa et M. Steinby, Ed., Springer Verlag, 1977, p. 95-110. | Zbl | MR
9., The CUCH as a Formal and Description Language, in Formal Languages, Description Languages for Computer Programming, T. B. Steel, Ed., North Holland, 1966, p. 179-197, | Zbl
10. et , Effet cachant et complexité de réduction en logique combinatoire, Rapport interne Université Paul-Sabatier, Laboratoire « Langages et Systèmes Informatiques », 1978.
11., Étude de la complexité de calcul en logique combinatoire, Thèse 3e Cycle, Université Paul-Sabatier, 1978.
12., et , Combinatory Logic, vol. 1, North Holland, Amsterdam, 1968. | Zbl | MR
13. et , Computational Complexity and Structures of λ-Terms, in Programmation, Proceedings of the 2nd International Symposium on Programming, B. Robinet, Ed., Dunod, Paris, 1976, p. 160-181.
14., et, Introduction to CombinatoryLogic, Cambridge University Press, 1972. | Zbl
15., A Lambda-Calculus Approach, Advances in Programming and Non Numerical Computation, Pergamon Press, 1966, p. 97-141. | Zbl
16. , Réductions correctes et optimales dans le Lambda-Calcul, Thèse de Doctorat, Université Paris-VII, 1978.
17. , Recursive Functions of Symbolic Expressions and their Computat by Machine, Part I, Comm. A.C.M., vol. 3, n° 4, 1960, p. 184-195. | Zbl
18. , Logique Combinatoire et Algorithmes, C.R. Académie des Sciences, Paris, t. 272, p. 1435-1438 et p. 1485-1488, série A, 1971. | Zbl | MR
19. , Sulla Terminazione in Classi Subricorsive di Algorithmi, A.I.C.A., Congress Genova, 1975.
20. , Combinators as Tree-transducers, Colloque sur les Arbres en Algèbre et en Programmation, Lille, 1977. | Zbl
21. , A simple Typeless Language Based on the Principle of Completeness and the Reference Concept, Comm. A.C.M., vol. 13, n° 5, 1970, p. 308-319. | Zbl
22. , Un modèle fonctionnel des structures de contrôle, R.A.I.R.O. Informatique théorique, vol. 11, n° 3, 1977, p. 213-236. | Zbl | MR | Numdam
23. , A Mathematical Logic without Variables, Annals of Maths, n° 2, 36, 1935, p. 127-150. | MR | JFM
24. , De l'organigramme à la formule, Thèse de Doctorat, Université Pierre-et-Marie-Curie, Paris, 1974.
25. , Types of Combinatory Logic, Notre-Dame Journal of Formal Logic (5). 1964, p. 161-180. | Zbl | MR
26. , Proof Techniques for Recursive Programs, Ph. D. Thesis, Stanford, 1973.
