Definability and Full Abstraction (Q2864154): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56092887, #quickstatements; #temporary_batch_1711234560214
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Explicit substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain theory in logical form / 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: Full abstraction for PCF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4160405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential algorithms on concrete data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3756499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequentiality in an extensional framework / 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: Q3149661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new type assignment for λ-terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The categorical abstract machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the symmetry of sequentiality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On infinite \(\eta\)-expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic game semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The regular-language semantics of second-order idealized ALGOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On denotational completeness / 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: A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus / 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: Concrete domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4457459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential algorithms for unbounded nondeterminism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unary PCF is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitary PCF is not decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sequentially realizable functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Payoffs, Intensionality and Abstraction in Games / 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: A type-theoretical alternative to ISWIM, CUCH, OWHY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanizing logical relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus / rank
 
Normal rank

Revision as of 02:56, 7 July 2024

scientific article
Language Label Description Also known as
English
Definability and Full Abstraction
scientific article

    Statements

    Definability and Full Abstraction (English)
    0 references
    6 December 2013
    0 references
    operational semantics
    0 references
    denotational semantics
    0 references
    sequentiality
    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