The typed lambda-calculus is not elementary recursive (Q1259590): 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/0304-3975(79)90007-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988983596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5824357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of prepositional types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5686017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unification algorithm for typed \(\overline\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Connection between Equivalence of Proofs and Cartesian Closed Categories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully abstract models of typed \(\lambda\)-calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5559220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definierbare Funktionen imλ-Kalkül mit Typen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intuitionistic propositional logic is polynomial-space complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness, invariance and <i>λ</i>-definability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Godel's interpretation of intuitionism / rank
 
Normal rank

Latest revision as of 01:38, 13 June 2024

scientific article
Language Label Description Also known as
English
The typed lambda-calculus is not elementary recursive
scientific article

    Statements

    The typed lambda-calculus is not elementary recursive (English)
    0 references
    0 references
    1979
    0 references
    typed lambda calculus
    0 references
    proof theory
    0 references
    length of derivations
    0 references
    lower bounds
    0 references
    elementary recursive calculus
    0 references

    Identifiers