A safe approach to parallel combinator reduction

DOI10.1016/0304-3975(86)90004-6MaRDI QIDQ1095642zbMATH OpenOpenAlexFDO

Authors Chris Hankin, Geoffrey L. Burn, Simon 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

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

Cites work

• scientific article; zbMATH DE number 1638668 (Why is no real title available?)
• scientific article; zbMATH DE number 3817015 (Why is no real title available?)
• scientific article; zbMATH DE number 3817067 (Why is no real title available?)
• scientific article; zbMATH DE number 3938547 (Why is no real title available?)
• scientific article; zbMATH DE number 3942995 (Why is no real title available?)
• scientific article; zbMATH DE number 3967886 (Why is no real title available?)
• scientific article; zbMATH DE number 3982495 (Why is no real title available?)
• Annotations to Control Parallelism and Reduction Order in the Distributed Evaluation of Functional Programs
• Another algorithm for bracket abstraction
• Director strings as combinators
• Needed reduction and spine strategies for the lambda calculus
• Strictness analysis for higher-order functions
• The Category-Theoretic Solution of Recursive Domain Equations

Cited in

(1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095642)