Abstract computing machines. A lambda calculus perspective.

DOI10.1007/B138965zbMath1075.68003OpenAlexW2491067158MaRDI QIDQ1769930

Werner Kluge

Publication date: 30 March 2005

Published in: Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b138965

zbMATH Keywords

computer organizationstate transition rules

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Functional programming and lambda calculus (68N18) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Mathematical problems of computer architecture (68M07)

Related Items (6)

Median filtering: a new insight ⋮ A resource semantics and abstract machine for \textit{Safe}: a functional language with regions and explicit deallocation ⋮ Refunctionalization at work ⋮ An Introduction to the Lambda Calculus ⋮ Abstract λ-Calculus Machines ⋮ A Resource-Aware Semantics and Abstract Machine for a Functional Language with Explicit Deallocation

This page was built for publication: Abstract computing machines. A lambda calculus perspective.