Denotational semantics as a foundation for cost recurrence extraction for functional languages (Q5101922): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Explicit substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost analysis of object-oriented bytecode programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Cost Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Inference of Resource Usage Upper and Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortised Resource Analysis with Separation Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysing the complexity of functional programs: higher-order meets first-order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can programming be liberated from the von Neumann style? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated higher-order complexity analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The semantics of second-order lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational cost analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two languages for estimating program efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource bound certification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Dependent Types and Relative Completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lightweight semiformal time complexity analysis for purely functional data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Denotational cost semantics for functional languages with inductive types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adventures in time and space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GADTs meet their match: pattern-matching warnings that account for GADTs, guards, and laziness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fistful of dollars: formalizing asymptotic complexity claims via deductive program verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate amortized resource analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards automatic resource bound analysis for OCaml / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Resource Analysis with Polynomial Potential / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static prediction of heap space usage for first-order functional programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static determination of quantitative resource usage for higher-order programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type-based cost analysis for lazy functional languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Coq Library for Internal Verification of Running-Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Purely Functional Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4965813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Category-Theoretic Solution of Recursive Domain Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanical program analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying asymptotic time complexity of imperative programs in Isabelle / rank
 
Normal rank

Latest revision as of 01:15, 30 July 2024

scientific article; zbMATH DE number 7581651
Language Label Description Also known as
English
Denotational semantics as a foundation for cost recurrence extraction for functional languages
scientific article; zbMATH DE number 7581651

    Statements

    Denotational semantics as a foundation for cost recurrence extraction for functional languages (English)
    0 references
    0 references
    0 references
    2 September 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers