scientific article; zbMATH DE number 7559273

DOI10.4230/LIPIcs.FSCD.2019.7MaRDI QIDQ5089006

Maciej Bendkowski

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1812.04452

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

zbMATH Keywords

combinatoricscomplexityexplicit substitutions\(\lambda\) calculus

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity analysis of term-rewriting systems
• (Leftmost-Outermost) Beta Reduction is Invariant, Indeed
• Optimality and inefficiency
• Almost Every Simply Typed $$\lambda $$-Term Has a Long $$\beta $$-Reduction Sequence
• λν, a calculus of explicit substitutions which preserves strong normalisation
• Combinatorics of $\lambda$-terms: a natural approach
• On the likelihood of normalization in combinatory logic
• Singularity Analysis of Generating Functions
• Explicit substitutions
• Normal-order reduction grammars
• A Machine-Oriented Logic Based on the Resolution Principle

This page was built for publication: