Gordon Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223--255, 1977. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Faithful Ideal Models for Recursive Polymorphic Types - Abadi, Pierce, Plotkin (1991) (12 citations) Self-citation (Plotkin) (Correct)
No context found.
Gordon Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223--256, 1977.
The Origins of Structural Operational Semantics - Plotkin (2003) (1 citation) Self-citation (Plotkin) (Correct)
No context found.
Gordon D. Plotkin, LCF Considered as a Programming Language, TCS, Vol. 5, No. 3, pp. 225-255, 1977.
The Origins of Structural Operational Semantics - Plotkin (2003) (1 citation) Self-citation (Plotkin) (Correct)
No context found.
Gordon D. Plotkin, LCF Considered as a Programming Language, Construction, Amelioration et Veri cation de Programmes, pp. 243-261, Colloques IRIA, Arc et Senans, 1975.
Logical Full Abstraction and PCF - Longley, Plotkin (1996) (1 citation) Self-citation (Plotkin) (Correct)
No context found.
G. Plotkin, LCF Considered as a Programming Language, Theoretical Comp. Sci., Vol. 5, pp. 223--255, 1977.
Controlling Effects - Filinski (1996) (2 citations) Self-citation (Plotkin) (Correct)
No context found.
Gordon D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5(3):223--255, December 1977.
Full Abstraction for PCF - Samson Abramsky Radha (1994) (116 citations) (Correct)
No context found.
Gordon Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223--255, 1977.
Equational Properties of Mobile Ambients - Gordon, Cardelli (1999) (35 citations) (Correct)
No context found.
G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223--255, 1977.
On the Semantics of Logic Program Composition - Antonio Brogi Department (Correct)
No context found.
G.D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223--256, 1977.
Sequential Algorithms and Strongly Stable Functions - Mellies (Correct)
No context found.
G. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223-255, 1977
Böhm's Theorem for Berarducci Trees - Dezani-Ciancaglini, Severi, de Vries (2000) (Correct)
No context found.
G. Plotkin. LCF considered as a programming language. Theoret. Comput. Sci., 5:223--256, 1977.
Type Preorders and Recursive Terms - Alessi, Dezani-Ciancaglini (2004) (Correct)
No context found.
Gordon Plotkin. LCF considered as a programming language. Theoret. Comput. Sci., 5:223--255, 1977.
Stable and Sequential Functions on Scott Domains - Brookes, Geva (1992) (1 citation) (Correct)
No context found.
G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5(3):223--255, 1977. 44
A Denotational Account of Untyped Normalization by Evaluation - Filinski, Rohde (2003) (1 citation) (Correct)
No context found.
Gordon D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5(3):223--255, December 1977.
How to Avoid the Formal Verification of a Theorem Prover - Avellone, Benini, Moscato (2001) (Correct)
No context found.
G.D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223--255, 1977.
An Object-Oriented Approach to Formal Specification - Smith (1992) (13 citations) (Correct)
No context found.
G. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5(3):223--256, 1977.
Games in the Semantics of Programming Languages - An Elementary.. - Jürjens (1999) (Correct)
No context found.
G. D. Plotkin, LCF considered as a programming language, Theoretical Computer Science 5 (1977), p. 223--255 E-mail address: jan@dcs.ed.ac.uk, http://www.dcs.ed.ac.uk/home/jan/ LFCS, DIVISIONOF INFORMATICS,UNIVERSITY OF EDINBURGH,GREAT BRITAIN
Proof Mining in Subsystems of Analysis - Oliva (2003) (Correct)
No context found.
G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223--255, 1977.
Strictness, Totality, and Non-Standard Type - Inference Mario Coppo (Correct)
No context found.
G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5(3):223--255, 1977.
Non-Deterministic untyped λ-calculus - A study about.. - Liguoro (1991) (Correct)
No context found.
G.D. Plotkin, "LCF considered as a programming language", TCS, 5, 1977.
Domain Theory for Concurrency - Nygaard (2003) (1 citation) (Correct)
No context found.
G. Plotkin. LCF considered as a programming language. Theoretical Computer Science 5(3): 225-255, 1977.
Names and Higher-Order Functions - Stark (1995) (29 citations) (Correct)
No context found.
G. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223--255, 1977. (pp. 6, 7)
Domain Theory for Concurrency - Nygaard (2003) (1 citation) (Correct)
No context found.
G. Plotkin. LCF considered as a programming language. Theoretical Computer Science 5(3): 225-255, 1977.
LISP AND SYMBOLIC COMPUTATION: An International Journal.. - Results And Conclusions (Correct)
No context found.
G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223-256, 1977.
On the Denotational Semantics of Staged Execution of Open Code - Pitts, Sheard (2004) (1 citation) (Correct)
No context found.
G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223--255, 1977.
How to Avoid the Formal Verification of a Theorem Prover - Avellone, al. (2001) (Correct)
No context found.
G.D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223-255, 1977.
First 50 documents Next 50
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