A proof-theoretic treatment of <i>λ</i>-reduction with cut-elimination: <i>λ</i>-calculus as a logic programming language (Q3011126)

From MaRDI portal
Revision as of 05:05, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A proof-theoretic treatment of <i>λ</i>-reduction with cut-elimination: <i>λ</i>-calculus as a logic programming language
scientific article

    Statements

    A proof-theoretic treatment of <i>λ</i>-reduction with cut-elimination: <i>λ</i>-calculus as a logic programming language (English)
    0 references
    0 references
    28 June 2011
    0 references
    term-sequent
    0 references
    cut-elimination
    0 references
    lambda-calculus
    0 references
    logic programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references