Automated higher-order complexity analysis (Q1827392): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2003.10.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2135155734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs as programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher type recursion, ramification and polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity via programming languages: Constant factors do matter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated complexity analysis of Nuprl extracted programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3794177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on complexity measures for inductive classes in constructive type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality and inefficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4726219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Naïve Time Analysis and its Theory of Cost Equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intensional interpretations of functionals of finite type I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanical program analysis / rank
 
Normal rank

Latest revision as of 19:20, 6 June 2024

scientific article
Language Label Description Also known as
English
Automated higher-order complexity analysis
scientific article

    Statements

    Automated higher-order complexity analysis (English)
    0 references
    0 references
    6 August 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    Computational complexity analysis
    0 references
    Functional programs
    0 references
    Higher-order complexity
    0 references
    Program synthesis
    0 references
    Feasible mathematics
    0 references
    0 references
    0 references
    0 references