Director strings as combinators

DOI10.1145/48022.48026zbMath0669.68013OpenAlexW2160667911MaRDI QIDQ3823125

Richard Kennaway, Ronan Sleep

Publication date: 1988

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toplas/1988-10/

zbMATH Keywords

complexityfunctional languageslambda calculuscombinators

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Data structures (68P05) General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)

Related Items (10)

The BC-chain method for representing combinators in linear space ⋮ The Reduceron reconfigured and re-evaluated ⋮ Variable abstraction in O(n log n) space ⋮ A safe approach to parallel combinator reduction ⋮ Call-by-value combinatory logic and the lambda-value calculus ⋮ Spinal atomic \(\lambda\)-calculus ⋮ Translating higher-order clauses to first-order clauses ⋮ Capturing strong reduction in director string calculus ⋮ Lambda-calculus with director strings ⋮ The combinator S

This page was built for publication: Director strings as combinators