Selective strictness and parametricity in structural operational semantics, inequationally (Q2464947): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061156817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Languages and Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functorial polymorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2852350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and loose reasoning is morally correct / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematics of Program Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof Tool Support for Explicit Strictness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A syntactic theory of sequential control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secrets of the Glasgow Haskell Compiler inliner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic augment and generalised short cut fusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametricity of extensionally collapsed term models of polymorphism and their categorical properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The logic of demand in Haskell / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of short-cut fusion and its correctness proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short cut fusion is correct / rank
 
Normal rank
Property / cites work
 
Property / cites work: On proving the correctness of program transformations based on free theorems for higher-order polymorphic calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free theorems in the presence of <i>seq</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2704324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric polymorphism and operational equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5713333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structural approach to operational semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Languages and Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical relations and the typed λ-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortcut fusion for accumulating parameters &amp; zip-like functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm + strategy = parallelism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concatenate, reverse and map vanish for free / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boxy types / rank
 
Normal rank

Latest revision as of 13:26, 27 June 2024

scientific article
Language Label Description Also known as
English
Selective strictness and parametricity in structural operational semantics, inequationally
scientific article

    Statements

    Selective strictness and parametricity in structural operational semantics, inequationally (English)
    0 references
    0 references
    0 references
    18 December 2007
    0 references
    Clean
    0 references
    Haskell
    0 references
    extensionality principles
    0 references
    fixpoint recursion
    0 references
    functional programming languages
    0 references
    identity extension
    0 references
    lambda calculus
    0 references
    logical relations
    0 references
    mixing strict and nonstrict semantics
    0 references
    parametric polymorphism
    0 references
    program transformations
    0 references
    seg
    0 references
    short cut Fusion
    0 references
    theorems for free
    0 references
    types
    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