Full abstraction for PCF (Q1854394): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56443857, #quickstatements; #temporary_batch_1710976035288
Created claim: DBLP publication ID (P1635): journals/iandc/AbramskyJM00, #quickstatements; #temporary_batch_1731475607626
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3999206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs as processes / 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: Q4843177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4490717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4513619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lambda calculus. Its syntax and semantics. Rev. ed. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential algorithms on concrete data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projecting sequential algorithms on strongly stable functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3203017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4204146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3824307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitary PCF is not decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5726697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4123496 / 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: LCF considered as a programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040912 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/iandc/AbramskyJM00 / rank
 
Normal rank

Latest revision as of 06:50, 13 November 2024

scientific article
Language Label Description Also known as
English
Full abstraction for PCF
scientific article

    Statements

    Full abstraction for PCF (English)
    0 references
    0 references
    0 references
    0 references
    14 January 2003
    0 references
    intensional model
    0 references
    PCF
    0 references
    definability
    0 references
    fully abstract model
    0 references
    recursive strategy
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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