A verified framework for higher-order uncurrying optimizations (Q968367): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10990-010-9050-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073733988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Imperative self-adjusting computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Languages and Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem Proving in Higher Order Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The categorical abstract machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatory logic. With two sections by William Craig. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid type checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order arity raising / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order unCurrying / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic typing: Syntax and proof theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A call-by-name lambda-calculus machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mechanical Evaluation of Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extraction in Coq: An Overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making a fast curry: push/enter vs. eval/apply for higher-order languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical relations and the typed λ-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal verification of translation validators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus with polymorphic and polyvariant flow types / rank
 
Normal rank

Latest revision as of 18:47, 2 July 2024

scientific article
Language Label Description Also known as
English
A verified framework for higher-order uncurrying optimizations
scientific article

    Statements

    A verified framework for higher-order uncurrying optimizations (English)
    0 references
    0 references
    0 references
    5 May 2010
    0 references
    functional programming languages
    0 references
    compiler optimization
    0 references
    compiler verification
    0 references
    semantic preservation
    0 references
    mechanized verification
    0 references
    0 references
    0 references

    Identifiers