A proof-theoretic treatment of \(\lambda \)-reduction with cut-elimination: \(\lambda \)-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 the normal view instead:
scientific article; zbMATH DE number 5913857
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A proof-theoretic treatment of \(\lambda \)-reduction with cut-elimination: \(\lambda \)-calculus as a logic programming language |
scientific article; zbMATH DE number 5913857 |
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
0.8723239302635193
0 references
0.78914874792099
0 references
0.7824719548225403
0 references
0.7821831703186035
0 references
