Higher-order interpretations and program complexity (Q276254): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.1016/j.ic.2015.12.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1508002867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4447246 / 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: A Combination Framework for Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PolyTime Functional Language from Light Linear Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-Order Interpretations and Program Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light types for polynomial time computation in lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new recursion-theoretic characterization of the polytime functions / 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: Algorithms with polynomial interpretation termination proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-interpretations. A way to control resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-interpretation Synthesis by Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Dependent Types and Relative Completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizability models and implicit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivational Complexity Is an Invariant Cost Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constructor Rewrite Systems and the Lambda-Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings for term-rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Interpretations for Higher-Order Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Soft Type Assignment System for λ-Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe recursion with higher types and BCK-algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear types and non-size-increasing polynomial time computation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatory reduction systems: Introduction and survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2767004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Derivational Complexity Induced by the Dependency Pair Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3127078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778888 / rank
 
Normal rank

Latest revision as of 21:38, 11 July 2024

scientific article
Language Label Description Also known as
English
Higher-order interpretations and program complexity
scientific article

    Statements

    Higher-order interpretations and program complexity (English)
    0 references
    0 references
    0 references
    3 May 2016
    0 references
    implicit computational complexity
    0 references
    term rewriting systems
    0 references
    type systems
    0 references
    lambda-calculus
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers