Static extensivity analysis for \(\lambda\)-definable functions over lattices (Q2493277): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Constructive versions of Tarski's fixed point theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract interpretation and application to logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PAG -- an efficient program analyzer generator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5334323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary and sufficient criterion for the monotonicity of Boolean functions with deterministic and stochastic applications / rank
 
Normal rank

Revision as of 16:52, 24 June 2024

scientific article
Language Label Description Also known as
English
Static extensivity analysis for \(\lambda\)-definable functions over lattices
scientific article

    Statements

    Static extensivity analysis for \(\lambda\)-definable functions over lattices (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 June 2006
    0 references
    0 references
    function extensivity
    0 references
    deductive system
    0 references
    constraint solving procedure
    0 references