A safe approach to parallel combinator reduction

DOI10.1016/0304-3975(86)90004-6zbMath0632.68017OpenAlexW2160453029MaRDI QIDQ1095642

Chris Hankin, Geoffrey L. Burn, Simon L. Peyton Jones

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90004-6

zbMATH Keywords

parallelismparallel implementationfunctional languagestrictness analysisparallel reductiondirector stringsparallel combinator

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)

Related Items

An operational semantics for paragon: A design notation for parallel architectures

Cites Work

• Strictness analysis for higher-order functions
• Needed reduction and spine strategies for the lambda calculus
• Annotations to Control Parallelism and Reduction Order in the Distributed Evaluation of Functional Programs
• Director strings as combinators
• The Category-Theoretic Solution of Recursive Domain Equations
• Another algorithm for bracket abstraction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A safe approach to parallel combinator reduction