Free Access
Issue
RAIRO. Inform. théor.
Volume 14, Number 3, 1980
Page(s) 301 - 314
DOI https://doi.org/10.1051/ita/1980140303011
Published online 01 February 2017
  1. 1. H. P. BARENDREGT, Some Extensional Term Models for Combinatory Logics and λ-calculi, Ph. D. thesis, Utrecht University, the Netherlands, 1971.
  2. 2. C. BÖHM, The CUCH as a Formal and Description Language, in Formal Language, Description Languages for Computer Programming, T. B. STEAL Jr., éd.,p. 179-197, 1966, North Holland, Amsterdam.
  3. 3. C. BÖHM et M. DEZANI-CIANCAGLINI, Lambda-Terms as Total or Partial Function on Normal Forms, Lambda Calculus and Computer Science Theory, Lecture Notes in Computer Science, vol. 37, 1975, p. 96-121, Springer Verlag. [MR: 485296] [Zbl: 0342.02017]
  4. 4. C. BÖHM et M. DEZANI-CIANCAGLINI, Termination Test Inside λ-Calculus, Automata Languages and Programming, A. SOLOMA, éd., Lecture Notes in Computer Science, vol. 52, 1977, Springer-Verlag, Turku. [Zbl: 0358.02025] [MR: 465807]
  5. 5. H. B. CURRY, J. R. HINDLEY et J. P. SELDIN, Combinatory Logic, vol. 2, 1972, Amsterdam, North Holland. [Zbl: 0242.02029]
  6. 6. M. COPPO et M. DEZANI-CIANCAGLINI, A Proposal for a New Type Assignment for λ-Terms, Rapport Interne, Université de Turin, 1976. [Zbl: 0418.03010]
  7. 7. M. COPPO et M. DEZANI-CIANCAGLINI, A Generalized Type Theory for λ-Calculus, Rapport Interne, Université de Turin, 1977. [Zbl: 0358.02025]
  8. 8. M. COPPO et M. DEZANI-CIANCAGLINI, A New Type Assignment for λ-Terms, in Archiv Für Math. Logik und Grundlageforshung, vol. 19, 1978, p. 1-17. [EuDML: 137952] [MR: 539868] [Zbl: 0418.03010]
  9. 9. M. COPPO, M. DEZANI CIANCAGLINI et P. SALLÉ, Functional Characterisation of Some Semantic Equalities Inside λ-Calculus, Automata Languages and Programming, E. MAURER, éd., Lecture Notes in Computer Science, 1979. [MR: 573238] [Zbl: 0411.03013]
  10. 10. J. P. LANDIN, A Correspondence between ALGOL-60 and Church's λ-Notation, C.A.C.M., vol. 8, February and March 1965, p. 89-101 et 158-165. [Zbl: 0134.33403]
  11. 11. J. H. MORRIS, Lambda Calculus Models of Programming Languages, Ph. D., M.I.T., 1968.
  12. 12. L. NOLIN, Les modèles Informatiques des λ-calculs, λ-Calculus and Computer Science Theory, Proceedings of the Symposium Held in Rome, C. BÖHM, éd., Springer Verlag, 1975, p. 166-176. [Zbl: 0354.02024]
  13. 13. B. ROBINET, Contribution à l'étude des réalités informatiques, Thèse Doctorat, n° I.P. 74-9, Paris, 1974.
  14. 14. B. ROBINET et F. NOZICK, Sémantique des structures de contrôle, R.A.I.R.O. Informatique théorique, vol. 11, n ° l, 1977, p. 63-74. [EuDML: 92043] [MR: 483652] [Zbl: 0354.68027]
  15. 15. B. ROBINET, 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. [EuDML: 92054] [MR: 502167] [Zbl: 0389.68015]
  16. 16. L. E. SANCHIS, Types of Combinatory Logic, Notre Dame Journal of Formal Logic, (5), 1964, p. 161-180. [MR: 205849] [Zbl: 0158.24704]
  17. 17. P. SALLÉ, Types et étiquettes dans le λ-calcul (à paraître).
  18. 18. P. SALLÉ, La notion de types en λ-calcul, Groupe Programmation et Languages A.F.C.E.T., Bulletin n° 3, 1978.
  19. 19. P. SALLÉ, Une extension de la théorie des types en λ-calcul, Lecture Notes in Computer Science, vol. 62, 1978, Springer Verlag, p. 398-410. [MR: 520856] [Zbl: 0384.03008]
  20. 20. P. SALLÉ et J. L. DURIEUX, L'échappement comme sémantique des structures de contrôle, Actes du Congrès A.F.C.E.T. T.T.I., Gif-sur-Yvette, novembre 1978, p. 77-87.
  21. 21. C. P. WADSWORTH, The Relation Between Lambda Expressions and Their Denotations in Scott's Models for the λ-Calculus, Séminaire I.R.I.A., 1974.

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.