On the public citation graph
Multiprocessor execution of functional programs
0 signed · 84 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-15975-4_26openalex-snapshot
Miranda: A non-strict functional language with polymorphic types
inferredcites →https://doi.org/10.1007/3-540-15975-4_37openalex-snapshot
Lambda lifting: Transforming programs to recursive equations
inferredcites →https://doi.org/10.1007/3-540-17945-3_10openalex-snapshot
Distributed garbage collection using reference counting
inferredcites →https://doi.org/10.1007/3-540-17945-3_25openalex-snapshot
An efficient garbage collection scheme for parallel computer architectures
inferredcites →https://doi.org/10.1007/3-540-18317-5_22openalex-snapshot
Detecting sharing of partial applications in functional programs
inferredcites →https://doi.org/10.1007/3-540-18317-5_7openalex-snapshot
GRIP — a high-performance architecture for parallel graph reduction
inferredcites →https://doi.org/10.1007/bf01383883openalex-snapshot
Multiprocessor execution of functional programs
inferredcites →https://doi.org/10.1016/0141-9331(87)90510-2openalex-snapshot
The implementation of functional programming languages
inferredcites →https://doi.org/10.1049/ep.1985.0449openalex-snapshot
Distributed Computing Systems Programme
inferredcites →https://doi.org/10.1109/52.1995openalex-snapshot
Applicative parallelism on a shared-memory multiprocessor
inferredcites →https://doi.org/10.1109/mark.1979.8817294openalex-snapshot
A loosely-coupled applicative multi-processing system
inferredcites →https://doi.org/10.1145/319838.319875openalex-snapshot
A protocol for distributed reference counting
inferredcites →https://doi.org/10.1145/359576.359579openalex-snapshot
Can programming be liberated from the von Neumann style?
inferredcites →https://doi.org/10.1145/502874.502880openalex-snapshot
Efficient compilation of lazy evaluation
inferredcites →https://doi.org/10.1145/502949.502880openalex-snapshot
Efficient compilation of lazy evaluation
inferredcites →https://doi.org/10.1145/62297.62356openalex-snapshot
Implementing functional programs on a hypercube multiprocessor
inferredcites →https://doi.org/10.1145/62678.62683openalex-snapshot
Buckwheat: graph reduction on a shared-memory multiprocessor
inferredcites →https://doi.org/10.1145/73141.74846openalex-snapshot
Generational reference counting: a reduced-communication distributed storage reclamation scheme
inferredcites →https://doi.org/10.1145/800055.802033openalex-snapshot
Experiments in diffused combinator reduction
inferredcites →https://doi.org/10.1145/800068.802129openalex-snapshot
Super-combinators a new implementation method for applicative languages
inferredcites →https://doi.org/10.1145/800223.806764openalex-snapshot
ALICE a multi-processor reduction machine for the parallel evaluation CF applicative languages
inferredcites →https://doi.org/10.1145/800223.806766openalex-snapshot
The semantic elegance of applicative languages
inferredcites →https://doi.org/10.7551/mitpress/5239.001.0001openalex-snapshot
Parallel MIMD Computation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.4330030417openalex-snapshot
Experiments with a transputer‐based parallel graph reduction machine
inferred← citeshttps://doi.org/10.1002/spe.4380210505openalex-snapshot
A modular fully‐lazy lambda lifter in Haskell
inferred← citeshttps://doi.org/10.1007/3-540-17943-7_141openalex-snapshot
Overview of a parallel reduction machine project
inferred← citeshttps://doi.org/10.1007/3-540-18317-5_14openalex-snapshot
Pomset interpretations of parallel functional programs
inferred← citeshttps://doi.org/10.1007/3-540-18420-1_63openalex-snapshot
Arrays, non-determinism, side-effects, and parallelism: A functional perspective
inferred← citeshttps://doi.org/10.1007/3-540-54029-6_178openalex-snapshot
Partitioning and scheduling of parallel functional programs using complexity information
inferred← citeshttps://doi.org/10.1007/3-540-55599-4_107openalex-snapshot
An implementation of static functional process networks
inferred← citeshttps://doi.org/10.1007/3-540-55599-4_131openalex-snapshot
Exploiting parallelism in primitive operations on bulk data types
inferred← citeshttps://doi.org/10.1007/3-540-56891-3_26openalex-snapshot
Locality and false sharing in coherent-cache parallel graph reduction
inferred← citeshttps://doi.org/10.1007/3-540-57186-8_84openalex-snapshot
Inlining to reduce stack space
inferred← citeshttps://doi.org/10.1007/3-540-58184-7_116openalex-snapshot
Eliminating invalidation in coherent-cache parallel graph reduction
inferred← citeshttps://doi.org/10.1007/3-540-62828-2_134openalex-snapshot
Functional programming and parallel processing
inferred← citeshttps://doi.org/10.1007/3-540-63237-9_25openalex-snapshot
Making a packet: Cost-effective communication for a parallel graph reducer
inferred← citeshttps://doi.org/10.1007/3540512845_40openalex-snapshot
High-performance parallel graph reduction
inferred← citeshttps://doi.org/10.1007/3540512845_52openalex-snapshot
Overview of a parallel reduction machine project II
inferred← citeshttps://doi.org/10.1007/978-1-4471-3573-9_8openalex-snapshot
Improving Granularity in Parallel Functional Programs: A Graphical Winnowing System for Haskell
inferred← citeshttps://doi.org/10.1007/978-3-642-25002-6_56openalex-snapshot
Adaptive Task Granularity Strategy for OpenMP3.0 Task Model on Cell Architecture
inferred← citeshttps://doi.org/10.1007/bf02939495openalex-snapshot
Granularity analysis for exploiting adaptive parallelism of declarative programs on multiprocessors
inferred← citeshttps://doi.org/10.1007/bf02939530openalex-snapshot
Optimized parallel execution of declarative programs on distributed memory multiprocessors
inferred← citeshttps://doi.org/10.1007/bf02943577openalex-snapshot
Compiling CIL rewriting language for multiprocessors
inferred← citeshttps://doi.org/10.1007/s002240000092openalex-snapshot
First- and Second-Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing
inferred← citeshttps://doi.org/10.1016/0165-6074(90)90167-8openalex-snapshot
A demand-driven macro-dataflow schema for distributed graph reduction on multiple G-machines
inferred← citeshttps://doi.org/10.1016/0167-739x(90)90031-8openalex-snapshot
Simulation studies on the performance of an organizational model for graph reduction
inferred← citeshttps://doi.org/10.1016/j.jpdc.2003.06.001openalex-snapshot
A comparative analysis of fine-grain threads packages
inferred← citeshttps://doi.org/10.1016/s0167-2789(96)00319-3openalex-snapshot
Adaptive control of chaotic continuous-time systems with delay
inferred← citeshttps://doi.org/10.1016/s0167-739x(96)00019-2openalex-snapshot
Efficient shared-memory support for parallel graph reduction
inferred← citeshttps://doi.org/10.1016/s0167-8191(05)80105-xopenalex-snapshot
Divide-and-Conquer and parallel graph reduction
inferred← citeshttps://doi.org/10.1017/s0956796801003793openalex-snapshot
Pipelined functional tree accesses and updates: scheduling, synchronization, caching and coherence
inferred← citeshttps://doi.org/10.1017/s0956796802004343openalex-snapshot
Parallel and Distributed Haskells
inferred← citeshttps://doi.org/10.1017/s0956796897002669openalex-snapshot
E QUALS – a fast parallel implementation of a lazy language
inferred← citeshttps://doi.org/10.1017/s095679689700275xopenalex-snapshot
A competitive algorithm for managing sharing in the distributed execution of functional programs
inferred← citeshttps://doi.org/10.1017/s0960129500001547openalex-snapshot
Continuation-based compilation of functional languages for parallel machines
inferred← citeshttps://doi.org/10.1023/a:1025641323400openalex-snapshot
Comparing Parallel Functional Languages: Programming and Performance
inferred← citeshttps://doi.org/10.1093/comjnl/32.2.152openalex-snapshot
An Optimising Compiler for a Modern Functional Language
inferred← citeshttps://doi.org/10.1109/71.86103openalex-snapshot
Lazy task creation: a technique for increasing the granularity of parallel programs
inferred← citeshttps://doi.org/10.1109/icppw.2003.1240363openalex-snapshot
Type-based primitives for distributed data structures: a functional approach
inferred← citeshttps://doi.org/10.1109/spdp.1994.346168openalex-snapshot
Derivation and performance of a pipelined transaction processor
inferred← citeshttps://doi.org/10.1109/tencon.1989.177072openalex-snapshot
Decomposing functional programs for parallel computation
inferred← citeshttps://doi.org/10.1109/tencon.1989.177074openalex-snapshot
Parallel execution of equational programs
inferred← citeshttps://doi.org/10.1109/whp.1992.664387openalex-snapshot
Controlling Parallelism for Larger Grain Execution of Functional Programs Using Complexity Information
inferred← citeshttps://doi.org/10.1145/141471.141570openalex-snapshot
Fast parallel implementation of lazy languages—the EQUALS experience
inferred← citeshttps://doi.org/10.1145/182409.182439openalex-snapshot
Static dependent costs for estimating execution time
inferred← citeshttps://doi.org/10.1145/182590.182439openalex-snapshot
Static dependent costs for estimating execution time
inferred← citeshttps://doi.org/10.1145/199448.199511openalex-snapshot
Separation constraint partitioning
inferred← citeshttps://doi.org/10.1145/237502.237509openalex-snapshot
First and second order diffusive methods for rapid, coarse, distributed load balancing (extended abstract)
inferred← citeshttps://doi.org/10.1145/255129.255152openalex-snapshot
POSC—a partitioning and optimizing SISAL compiler
inferred← citeshttps://doi.org/10.1145/62297.62356openalex-snapshot
Implementing functional programs on a hypercube multiprocessor
inferred← citeshttps://doi.org/10.1145/62678.62683openalex-snapshot
Buckwheat: graph reduction on a shared-memory multiprocessor
inferred← citeshttps://doi.org/10.1145/72551.72554openalex-snapshot
Conception, evolution, and application of functional programming languages
inferred← citeshttps://doi.org/10.1145/91556.91631openalex-snapshot
Lazy task creation: a technique for increasing the granularity of parallel programs
inferred← citeshttps://doi.org/10.1145/91556.91648openalex-snapshot
Continuation-based parallel implementation of functional programming languages
inferred← citeshttps://doi.org/10.1145/99370.99386openalex-snapshot
Parallel graph reduction with the (v , G)-machine
inferred← citeshttps://doi.org/10.1145/99370.99387openalex-snapshot
An abstract machine for parallel graph reduction
inferred← citeshttps://doi.org/10.14236/ewic/fp1995.13openalex-snapshot
On the Granularity of Divide-and-Conquer Parallelism
inferred← citeshttps://doi.org/10.21236/ada237477openalex-snapshot
Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs
inferred← citeshttps://doi.org/10.25959/23212787openalex-snapshot
Effective Runtime Management of Parallelism in a Functional Programming Context
showing the first 58 of 59 · page through all 59
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.