Finitary PCF is not decidable (Q5958762): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q29396610 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4490717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymorphic rewriting conserves algebraic confluence / 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: Q4281476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unary PCF is decidable / 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: Kripke logical relations and PCF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of all minimal models / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCF considered as a programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4490721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical relations and the typed λ-calculus / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:28, 3 June 2024

scientific article; zbMATH DE number 1715807
Language Label Description Also known as
English
Finitary PCF is not decidable
scientific article; zbMATH DE number 1715807

    Statements

    Finitary PCF is not decidable (English)
    0 references
    3 March 2002
    0 references
    0 references
    PCF
    0 references
    Decidability
    0 references
    Lambda calculus
    0 references
    Full abstraction
    0 references
    0 references