A proof-theoretic treatment of <i>λ</i>-reduction with cut-elimination: <i>λ</i>-calculus as a logic programming language (Q3011126)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A proof-theoretic treatment of λ-reduction with cut-elimination: λ-calculus as a logic programming language |
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
28 June 2011
0 references
term-sequent
0 references
cut-elimination
0 references
lambda-calculus
0 references
logic programming
0 references
0 references
