Deciding inclusion of set constants over infinite non-strict data structures (Q5441550): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Manfred Schmidt-Schauss / rank
Normal rank
 
Property / author
 
Property / author: Manfred Schmidt-Schauss / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CLEAN / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Fudgets / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Haskell / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045633736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lambda calculus with explicit recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4282593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4311530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3729991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2722050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strictness, totality, and non-standard-type inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strictness and totality analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratic Fudgets: A semantic theory for an embedded coordination language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3771589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safety of Nöcker's strictness analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Equivalence of Finite Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3028326 / rank
 
Normal rank

Latest revision as of 16:01, 27 June 2024

scientific article; zbMATH DE number 5235510
Language Label Description Also known as
English
Deciding inclusion of set constants over infinite non-strict data structures
scientific article; zbMATH DE number 5235510

    Statements

    Deciding inclusion of set constants over infinite non-strict data structures (English)
    0 references
    0 references
    0 references
    0 references
    15 February 2008
    0 references
    DEXPTIME-completeness
    0 references
    lazy functional programming languages
    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