On Constructor Rewrite Systems and the Lambda-Calculus

DOI10.1007/978-3-642-02930-1_14zbMath1248.68275arXiv1208.0515OpenAlexW2135316487MaRDI QIDQ3638093

Simone Martini, Ugo Dal Lago

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Related Items (9)

Higher-order interpretations and program complexity ⋮ The Negligible and Yet Subtle Cost of Pattern Matching ⋮ On the enumeration of closures and environments with an application to random generation ⋮ On the value of variables ⋮ A Fresh Look at the λ-Calculus ⋮ Is the Optimal Implementation Inefficient? Elementarily Not ⋮ (In)efficiency and reasonable cost models ⋮ A new order-theoretic characterisation of the polytime computable functions ⋮ COMPOSITIONALITY, COMPUTABILITY, AND COMPLEXITY

This page was built for publication: On Constructor Rewrite Systems and the Lambda-Calculus