On Constructor Rewrite Systems and the Lambda Calculus
From MaRDI portal
Publication:2904629
DOI10.2168/LMCS-8(3:12)2012zbMath1256.68091OpenAlexW2952902782MaRDI QIDQ2904629
Publication date: 15 August 2012
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2168/lmcs-8(3:12)2012
Functional programming and lambda calculus (68N18) Complexity of computation (including implicit computational complexity) (03D15) Grammars and rewriting systems (68Q42) Turing machines and related notions (03D10) Combinatory logic and lambda calculus (03B40)
Related Items (7)
A combination framework for complexity ⋮ On sharing, memoization, and polynomial time ⋮ Linear pattern matching of compressed terms and polynomial rewriting ⋮ Unnamed Item ⋮ Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic ⋮ A Fresh Look at the λ-Calculus ⋮ (In)efficiency and reasonable cost models
This page was built for publication: On Constructor Rewrite Systems and the Lambda Calculus
