Stable models of typed λ-calculi-Reference-Cited by-同舟云学术

Stable models of typed λ-calculi

Published:1978 Issue: Volume: Page:72-89
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Berry Gérard

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-08860-1_7.pdf

Reference23 articles.

1. G. BERRY, "Bottom-up Computations of Recursive Programs", R.A.I.R.O. Informatique Theorique, vol.10, no 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 Recursive Programs", Proc. 3rd ACM Symposium on Principles of Programming Languages, Los Angeles, jan. 1977. To appear in JACM.

Cited by 82 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Making Concurrency Functional;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

2. Logic Beyond Formulas;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08

3. Taylor subsumes Scott, Berry, Kahn and Plotkin;Proceedings of the ACM on Programming Languages;2020-01

4. Normal forms, linearity, and prime algebraicity over nonflat domains;Mathematical Logic Quarterly;2018-04

5. Spatio-Temporal Domains: An Overview;Theoretical Aspects of Computing – ICTAC 2018;2018