Theoretical Computer Science, 1, 125--159. Plotkin, Gordon. 1977. LCF Considered as a Programming Language. Theoretical Computer Science, 5, 223--257. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Relational Interpretations of Recursive Types in an.. - Lars Birkedal And (1997) (15 citations) (Correct)
No context found.
Theoretical Computer Science, 1, 125--159. Plotkin, Gordon. 1977. LCF Considered as a Programming Language. Theoretical Computer Science, 5, 223--257.
Compilation and Equivalence of Imperative Objects - Gordon, Hankin, Lassen (1997) (23 citations) (Correct)
No context found.
Theoretical Computer Science 1, 125--159. Plotkin, G. D. (1977). LCF considered as a programming language. Theoretical Computer Science 5, 223--255.
Relational Interpretations of Recursive Types in an.. - Birkedal, Harper (1997) (15 citations) (Correct)
No context found.
Theoretical Computer Science, 1, 125--159. Plotkin, Gordon. 1977. LCF Considered as a Programming Language. Theoretical Computer Science, 5, 223--257.
Compilation and Equivalence of Imperative Objects - Gordon, Hankin, Lassen (1997) (23 citations) (Correct)
No context found.
Theoretical Computer Science 1, 125--159. Plotkin, G. D. (1977). LCF considered as a programming language. Theoretical Computer Science 5, 223--255.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC