scientific article; zbMATH DE number 7205321

DOI10.4230/LIPIcs.RTA.2012.6zbMath1437.68038MaRDI QIDQ5111891

Beniamino Accattoli

Publication date: 27 May 2020

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

zbMATH Keywords

diagrammatic reasoning\(\lambda\)-calculusexplicit substitutionsstandardizationabstract rewriting

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)

Related Items (8)

The Negligible and Yet Subtle Cost of Pattern Matching ⋮ On the value of variables ⋮ Proof nets and the call-by-value \(\lambda\)-calculus ⋮ Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic ⋮ A faithful and quantitative notion of distant reduction for generalized applications ⋮ Tight typings and split bounds, fully developed ⋮ Factorization in call-by-name and call-by-value calculi via linear logic ⋮ A Fresh Look at the λ-Calculus

This page was built for publication: