Games and full abstraction for FPC. (Q1854351): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1006/inco.1999.2845 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2650831125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games and full completeness for multiplicative linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4490717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully abstract semantics for observably sequential languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: I-categories as a framework for solving domain equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatic Domain Theory in Categories of Partial Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3978971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4204146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On full abstraction for PCF: I, II and III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game theoretic analysis of call-by-value computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games and Definability For FPC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully abstract models of typed \(\lambda\)-calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kripke logical relations and PCF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational properties of domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCF considered as a programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Category-Theoretic Solution of Recursive Domain Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141916 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/INCO.1999.2845 / rank
 
Normal rank

Latest revision as of 10:29, 16 December 2024

scientific article
Language Label Description Also known as
English
Games and full abstraction for FPC.
scientific article

    Statements

    Games and full abstraction for FPC. (English)
    0 references
    0 references
    14 January 2003
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references