Complexity of the combinator reduction machine

DOI10.1016/0304-3975(85)90076-3zbMath0591.68048OpenAlexW2072736133MaRDI QIDQ1075052

Sachio Hirokawa

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90076-3

zbMATH Keywords

recursive programsprogram schemecombinator codenumber of the reduction steps

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Unnamed Item
• The BC-chain method for representing combinators in linear space
• The lambda calculus, its syntax and semantics
• An efficient interpreter for the lambda-calculus
• A linear space translation of functional programs to Turner combinators
• A new implementation technique for applicative languages
• Minimal and Optimal Computations of Recursive Programs
• Another algorithm for bracket abstraction

This page was built for publication: Complexity of the combinator reduction machine