Lambda calculus with algebraic simplification for reduction parallelisation: extended study

DOI10.1017/S0956796821000058MaRDI QIDQ5016210zbMATH OpenOpenAlexFDO

Authors Akimasa Morihata

Publication date 13 December 2021

Published in Journal of Functional Programming (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/s0956796821000058

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Parallel reductions in \(\lambda\)-calculus
• scientific article; zbMATH DE number 1231694
• PELCR: parallel environment for optimal lambda-calculus reduction
• Parallel reductions in \(\lambda\)-calculus
• scientific article; zbMATH DE number 1953288

Cites work

• An algebraic interpretation of the K-calculus; and an application of a labelled -calculus
• Automatic parallelization of recursive functions using quantifier elimination
• Balanced trees inhabiting functional parallel programming
• Extracting and implementing list homomorphisms in parallel program development
• Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms
• Filter-embedding semiring fusion for programming with MapReduce
• Functional programs as compressed data
• scientific article; zbMATH DE number 43723 (Why is no real title available?)
• scientific article; zbMATH DE number 2120508 (Why is no real title available?)
• Implicitly threaded parallelism in Manticore
• Lazy tree splitting
• Parallel functional programming on recursively defined data via data-parallel recursion
• Parallel Prefix Computation
• Phantom types and subtyping
• Polymorphic rewriting conserves algebraic strong normalization
• Programming Languages and Systems
• Programming languages and systems. 9th Asian symposium, APLAS 2011, Kenting, Taiwan, December 5--7, 2011. Proceedings
• Regular, shape-polymorphic, parallel arrays in Haskell
• Semantic evaluation; intersection types and complexity of simply typed lambda calculus
• The third homomorphism theorem on trees: downward \& upward lead to divide-and-conquer
• The Zipper

Cited in

(8)

• Lambda-calculi for (strict) parallel functions
• A symbolic and algebraic computation based lambda-Boolean reduction machine via PROLOG
• scientific article; zbMATH DE number 1231694 (Why is no real title available?)
• scientific article; zbMATH DE number 1547348 (Why is no real title available?)
• scientific article; zbMATH DE number 7089070 (Why is no real title available?)
• Simplifying reductions
• Constant time parallel computations in \(\lambda\)-calculus
• A generalized parallel prefix sums algorithm for arbitrary size arrays

This page was built for publication: Lambda calculus with algebraic simplification for reduction parallelisation: extended study

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