scientific article; zbMATH DE number 7559273

DOI10.4230/LIPICS.FSCD.2019.7MaRDI QIDQ5089006FDOQ5089006

Authors: Maciej Bendkowski 

Publication date: 18 July 2022

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

Title of this publication is not available (Why is that?)

zbMATH Keywords

combinatoricscomplexityexplicit substitutions\(\lambda\) calculus

Mathematics Subject Classification ID

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

Cites Work

• Analytic combinatorics
• Singularity Analysis of Generating Functions
• Complexity analysis of term-rewriting systems
• A Machine-Oriented Logic Based on the Resolution Principle
• Title not available (Why is that?)
• Explicit substitutions
• Optimality and inefficiency: what isn't a cost model of the lambda calculus?
• λν, a calculus of explicit substitutions which preserves strong normalisation
• Title not available (Why is that?)
• Normal-order reduction grammars
• Combinatorics of $\lambda$-terms: a natural approach
• (Leftmost-outermost) beta reduction is invariant, indeed
• Almost Every Simply Typed $$\lambda $$-Term Has a Long $$\beta $$-Reduction Sequence
• On the likelihood of normalization in combinatory logic

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089006)