scientific article; zbMATH DE number 1330453

zbMath0926.03076MaRDI QIDQ4261096

Jeff Polakow, Frank Pfenning

Publication date: 21 September 1999

Full work available at URL: http://www.elsevier.com/cas/tree/store/tcs/free/entcs/store/contents.htt?jrnl=tcs&sctn=entcs&mode=sub&vol=20#20026

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cut eliminationsequencingsequent calculusnormalizationnatural deduction systemlambda-calculusintuitionistic non-commutative linear logic

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Cut-elimination and normal-form theorems (03F05) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Structural rules and algebraic properties of intersection types ⋮ Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax

This page was built for publication: