Subject
General Computer Science,Theoretical Computer Science
Reference16 articles.
1. Domain theory;Abramsky,1994
2. The Lambda Calculus, its Syntax and Semantics;Barendregt,1984
3. G. Berry, Stable models of typed λ-calculi, in: Proc. 5th Internat. Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 62, Springer, Berlin, 1978, pp. 72–89.
4. Union-indecomposable varieties;Bulman-Fleming;Colloq. Math.,1976
5. P. Di Gianantonio, F. Honsell, S. Liani, G.D. Plotkin, Countable non-determinism and uncountable limits, in: Proc. CONCUR ’94, Lecture Notes in Computer Science, Vol. 836, Springer, Berlin, 1994, pp. 130–145. See also: Uncountable limits and the Lambda Calculus, Nordic J. Comput. 2, 1995, pp. 127–146.
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献