Stable models of typed λ-calculi

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 62 LNCS, Issue , 1978, Pages 72-89

  Berry, Gérard ^a  

^a PSL RESEARCH UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BIOMINERALIZATION; FUNCTIONS; SEMANTICS;

ABSTRACT MODELING; CONTINUOUS FUNCTIONS; DENOTATIONAL SEMANTICS; MODEL CONSTRUCTION; OPERATIONAL PROPERTIES; RESTRICTED MODELS; SEQUENTIAL LANGUAGES; STABLE FUNCTIONS;

ALGOL (PROGRAMMING LANGUAGE);

EID: 84912969735     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-08860-1_7     Document Type: Conference Paper

References (23)

1. G. BERRY, “Bottom-up Computations of Recursive Programs”, R. A. I. R. O. Informatique Theorique, vol. 10, n 3, mars 1976, pp 47-82.
2. G. BERRY, “Séquentialité de l’Evaluation formelle des λ-expressions”, Proc. 3rd International Colloquium on Programming, Paris, march 28-30, 1978, DUNOD.
3. G. BERRY, “Calculs Optimaux des Programmes dans les Interprétations stables”,Thèse de doctorat d’Etat, to appear.
4. G. BERRY, P. L. CURIEN, “Sequential Computations in Concrete Data structures”, to appear.
5. G. BERRY, J. J. LEVY, “Minimal and Optimal Computations of Reeursive Program”, Proc. 3rd ACM Symposium on Principles of Programming Languages, Los Angeles, jan. 1977. To appear in JACM.
6. B. COURCELLE, J. C. RAOULT, “Completion of ordered magmas”, Fondamenta Informatica, Poland 1978, to appear.
7. G. KAHN, G. PLOTKIN, “Concrete Data Structures”, to appear.
8. J. J. LEVY, “An algebraic interpretation of the λβK-calculus and an application of a labelled λ-calculus, Rome, 1975 and TCS, vol. 2, n 1, 1976, p. 97-114.
9. J. J. LEVY, “Réductions correctes et optimales dans le λ-calcul”, Thèse de doctorat d’Etat, Univ. Paris VII, jan. 1978.
10. R. MILNER, “Implementation and application of Scott’s logic for computable functions”, Proc. ACM Conference on Proving Assertions about Programs, SIGPLAN Notices 7, 1 (jan. 1972) 1 -6.
11. R. MILNER, “Models of LCF”, Stanford Comp. Sci. Dept. Memo. CS-73-332, Stanford, 1973.
12. R. MIIATER, “Fully Abstract Models of typed λ-calculi”, T. C. S. vol. 4, n 1, feb. 1977, pp. 1 - 23.
13. G. D. PLOTKIN, “LCF as a Programming Language”, Proc. Conf. Proving and Improving Programs, Arc-et-Senans, France, 1975, and T. C. S. vol. 5, n 3, 1977, pp. 223-257.
14. G. D. PLOTKIN, “A Powerdomain Construction”, SIAM Journal of Computing, Vol. 5, n 3, sept. 1976.
15. G. D. PLOTKIN, M. SMYTH, “The category-theoretic solution of recursive domain equations”, Proe. 18 th Annual Symposium on Foundations of Computer Science, Oct. 31 - Nov. 2, 1977.
16. V. Yu. SAZONOV, “Sequentially and Parallelly Computable functionals”, Rome, march 75. Springer - Verlag LNCS n 37.
17. D. SCOTT, “Data types as Lattices”, Lecture Notes, unplublished, Amsterdam 1972.
18. D. SCOTT, “Outline of a mathematical theory of Computation”, Proc. 4th Ann. Princeton Conf. on Information Sciences and Systems, Princeton Univ., Princeton, N. J., 1970, pp 169 - 176.
19. J. VUILLEMIN, “Proof Techniques for Recursive Programs”, Ph. D. Thesis, Stanford University, 1973.
20. ∞ model of the λ-calculus, SIAM Journal of Computing, vol. 5, n 3, sept. 1976.
21. M. WAND, “Fixed - Points Constructions in order-enriched Categories”, TR 23, Comp. Sci. Dept. Indiana Univ., 1975.
22. P. H. WELCH, “Continuous Semantics and Inside-out Reductions”, Rome, 1975, Springer Verlag, LNCS n 37.
23. G. HUET, “Résolution d’éqnations dans les langages d’ordre 1,2,…,ω”. Thèse d’Etat, Université PARIS 7, Paris, Sept. 1976.