Lambda calculus with algebraic simplification for reduction parallelisation: Extended study
From MaRDI portal
Publication:5016210
DOI10.1017/S0956796821000058OpenAlexW3141593354MaRDI QIDQ5016210
Publication date: 13 December 2021
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796821000058
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Functional programs as compressed data
- Programming languages and systems. 9th Asian symposium, APLAS 2011, Kenting, Taiwan, December 5--7, 2011. Proceedings
- Polymorphic rewriting conserves algebraic strong normalization
- An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
- Extracting and implementing list homomorphisms in parallel program development
- Filter-embedding semiring fusion for programming with MapReduce
- Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms
- Implicitly threaded parallelism in Manticore
- Lazy tree splitting
- Phantom types and subtyping
- Automatic Parallelization of Recursive Functions Using Quantifier Elimination
- Parallel Prefix Computation
- The Zipper
- Parallel functional programming on recursively defined data via data-parallel recursion
- Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus
- Regular, shape-polymorphic, parallel arrays in Haskell
- Balanced trees inhabiting functional parallel programming
- The third homomorphism theorem on trees
- Programming Languages and Systems
This page was built for publication: Lambda calculus with algebraic simplification for reduction parallelisation: Extended study
