@article{ITA_1979__13_3_257_0,
author = {Dezani-Ciancaglini, M. and Ronchi Della Rocca, S. and Saitta, L.},
title = {Complexity of $\lambda $-term reductions},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
volume = {13},
year = {1979},
pages = {257-287},
mrnumber = {554687},
zbl = {0424.03009},
language = {en},
url = {http://dml.mathdoc.fr/item/ITA_1979__13_3_257_0}
}
Dezani-Ciancaglini, M.; Ronchi Della Rocca, S.; Saitta, L. Complexity of $\lambda $-term reductions. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 13 (1979) pp. 257-287. http://gdmltest.u-ga.fr/item/ITA_1979__13_3_257_0/
1., A Lambda Calculus Model of Programming Languages. I. Simple Constructs and II. Jumps and Procedures, J. Comp. Languages, Vol. 1, 1976, pp. 287-301 and 303-320. | Zbl 0356.68042
2., Normed Uniformity Reflexive Structures, in C. BÖHM, Ed., (λ-Calculus and Computer Science Theory, Lecture Notes in Computer Science, No. 37, Springer-Verlag, 1975, pp. 272-286. | MR 472499 | Zbl 0333.02021
3., , and , Degrees, Reductions and Representability in Lambda Calculus, Preprint, University of Utrecht, Department of Mathematics, 1976.
4. and , On Recursiveness in Weak Combinatory Logic, in C. BÖHM, Ed., λ-Calculus and Computer Science Theory, Lecture Notes in Computer Science, No. 37, Springer-Verlag, 1975, pp. 297-311. | MR 479987 | Zbl 0332.02033
5. and , λ-terms as Total or Partial Functions on Normal Forms in C. BÖHM, Ed., λ-Calculus and Computer Science Theory, Lecture Notes in Computer Science, Vol. 37, Springer-Verlag, 1975, pp. 96-121. | MR 485296 | Zbl 0342.02017
6., On the Size of Machines, Information and Control, Vol. 11, 1967, pp. 257-265. | MR 233634 | Zbl 0165.02102
7., Complexité de la réduction en logique combinatoire, R.A.I.R.O., Informatique théorique, Vol. 12, 1978, pp.339-367. | Numdam | MR 517635 | Zbl 0432.03012
8. and , Calculs finis et infinis dans les termes combinatoires in B. ROBINET, Ed., λ-Calcul et Sémantique Formelle des langages de programmation, L.I.T.P.-E.N.S.T.A., 1979, pp. 109-130.
9. and , Combinatory Logic, Vol. I, North-Holland, Amsterdam, 1958. | MR 94298 | Zbl 0175.27601 | Zbl 0081.24104
10., and , Combinatory Logic, Vol. II, North-Holland, Amsterdam, 1972. | Zbl 0242.02029
11. and , Computational Complexity and Structure of ʎ-terms in B. ROBINET, Ed., Programmation, Dunod, Paris, 1976, pp. 160-181.
12., and , Complexité élémentaire dans le λ-calcul in B. ROBINET, Ed., λ-calcul et Sémantique formelle des langages de programmation, L.I.T.P.-E.N.S.T.A., 1979, pp. 183-212.
13., A Correspondence Between Algol 60and Church's Lambda Notation, Comm. A.C.M., Vol. 8, 1965, pp. 89-158. | Zbl 0134.33403
14., Axioms for Computation Theories-first draft in R. GANDY and M. YATES, Eds., Logic Colloquium'69, North Holland, Amsterdam, 1971, pp. 199-255. | MR 281610 | Zbl 0243.02034
15., A set Theoretical Definition of Application, School of A.I., Memo, M.I.P.-R-95, Edinburgh,, 1975.
16., Contribution à l'étude de réalités informatiques, Thèse, Université Paris-VI, 1974.
17., Continuous Lattices, Lecture Notes in Mathematics, No. 274, Springer-Verlag, 1972, pp. 97-136. | MR 404073 | Zbl 0239.54006
18., Data Types as Lattices, S.I.A.M. J., Comp., Vol. 5, 1976, pp. 522-587. | MR 437330 | Zbl 0337.02018
19., Combinators, λ-terms and Proof Theory, D. Reidel Publ. Company, Dordrecht-Holland, 1972. | MR 505306 | Zbl 0248.02032
20., Relation between Computational and Denotational Properties for Scott's Doo-Models of the Lambda Calculus S.I.A.M. J. Comp., Vol. 5, 1976, pp. 488-521. | MR 505308 | Zbl 0346.02013