On the public citation graph
Compiling lisp programs for parallel execution
0 signed · 60 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.1002/spe.4380090105openalex-snapshot
A new implementation technique for applicative languages
inferredcites →https://doi.org/10.1007/bf00263742openalex-snapshot
A system which automatically improves programs
inferredcites →https://doi.org/10.1007/bf00264598openalex-snapshot
Proving and applying program transformations expressed with second-order patterns
inferredcites →https://doi.org/10.1007/bf01808954openalex-snapshot
The interprocedural analysis and automatic parallelization of Scheme programs
inferredcites →https://doi.org/10.1016/0743-7315(88)90015-9openalex-snapshot
An overview of the PTRAN analysis system for multiprocessing
inferredcites →https://doi.org/10.1109/12.40843openalex-snapshot
The performance implications of thread management alternatives for shared-memory multiprocessors
inferredcites →https://doi.org/10.1109/52.31651openalex-snapshot
Multiprocessing extensions in Spur Lisp
inferredcites →https://doi.org/10.1109/71.80123openalex-snapshot
Parallelizing programs with recursive data structures
inferredcites →https://doi.org/10.1109/t-c.1972.223501openalex-snapshot
On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup
inferredcites →https://doi.org/10.1109/tc.1973.5009159openalex-snapshot
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
inferredcites →https://doi.org/10.1109/tc.1987.5009499openalex-snapshot
Compiler Algorithms for Synchronization
inferredcites →https://doi.org/10.1137/0201008openalex-snapshot
The Transitive Reduction of a Directed Graph
inferredcites →https://doi.org/10.1145/12276.13333openalex-snapshot
ORBIT: an optimizing compiler for scheme
inferredcites →https://doi.org/10.1145/24039.24041openalex-snapshot
The program dependence graph and its use in optimization
inferredcites →https://doi.org/10.1145/2591635.2667156openalex-snapshot
An overview of the PTRAN analysis system for multiprocessing
inferredcites →https://doi.org/10.1145/29873.29875openalex-snapshot
Automatic translation of FORTRAN programs to vector form
inferredcites →https://doi.org/10.1145/357073.357081openalex-snapshot
Compact Encodings of List Structure
inferredcites →https://doi.org/10.1145/4472.4478openalex-snapshot
MULTILISP: a language for concurrent symbolic computation
inferredcites →https://doi.org/10.1145/53990.53993openalex-snapshot
Detecting conflicts between structure accesses
inferredcites →https://doi.org/10.1145/55364.55416openalex-snapshot
Parcel: project for the automatic restructuring and concurrent evaluation of LISP
inferredcites →https://doi.org/10.1145/567532.567555openalex-snapshot
Dependence graphs and compiler optimizations
inferredcites →https://doi.org/10.1145/62115.62126openalex-snapshot
Restructuring Lisp programs for concurrent execution
inferredcites →https://doi.org/10.1145/62115.62127openalex-snapshot
Qlisp: experience and new directions
inferredcites →https://doi.org/10.1145/62116.62126openalex-snapshot
Restructuring Lisp programs for concurrent execution
inferredcites →https://doi.org/10.1145/62116.62127openalex-snapshot
Qlisp: experience and new directions
inferredcites →https://doi.org/10.1145/62678.62682openalex-snapshot
Parallel execution of sequential scheme with ParaTran
inferredcites →https://doi.org/10.1145/62678.62694openalex-snapshot
An implementation of portable standard LISP on the BBN butterfly
inferredcites →https://doi.org/10.1145/62678.62696openalex-snapshot
Preliminary results with the initial implementation of Qlisp
inferredcites →https://doi.org/10.1145/62678.62718openalex-snapshot
A simple and efficient implmentation approach for single assignment languages
inferredcites →https://doi.org/10.1145/73141.74821openalex-snapshot
Dependence analysis for pointer variables
inferredcites →https://doi.org/10.1145/77606.77608openalex-snapshot
Interprocedural slicing using dependence graphs
inferredcites →https://doi.org/10.1145/800055.802019openalex-snapshot
Queue-based multi-processing LISP
inferredcites →https://doi.org/10.1145/93542.93585openalex-snapshot
Analysis of pointers and structures
inferredcites →https://doi.org/10.1145/960116.53993openalex-snapshot
Detecting conflicts between structure accesses
inferredcites →https://doi.org/10.1145/989393.989429openalex-snapshot
Analysis of pointers and structures
inferredcites →https://doi.org/10.1147/rd.182.0138openalex-snapshot
Parallel Solution of Recurrence Problems
inferredcites →https://doi.org/10.2172/5768416openalex-snapshot
Automatic generation of synchronization instructions for parallel processors
inferredcites →https://doi.org/10.7551/mitpress/5298.001.0001openalex-snapshot
Performance and Evaluation of LISP Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-55425-4_8openalex-snapshot
Using the Reform inference system for parallel Prolog
inferred← citeshttps://doi.org/10.1007/3-540-57502-2_48openalex-snapshot
Supporting SPMD execution for dynamic data structures
inferred← citeshttps://doi.org/10.1007/bf03356759openalex-snapshot
Connection Analysis: A Practical Interprocedural Heap Analysis for C
inferred← citeshttps://doi.org/10.1007/bfb0014221openalex-snapshot
Connection analysis: A practical interprocedural heap analysis for C
inferred← citeshttps://doi.org/10.1007/bfb0038670openalex-snapshot
Run-time management of Lisp parallelism and the Hierarchical Task Graph program representation
inferred← citeshttps://doi.org/10.1016/0096-0551(93)90006-mopenalex-snapshot
Designing programming languages for the analyzability of pointer data structures
inferred← citeshttps://doi.org/10.1109/71.238302openalex-snapshot
Loop-level parallelism in numeric and symbolic programs
inferred← citeshttps://doi.org/10.1109/mpcs.1994.367033openalex-snapshot
Symbolic computing, Lisp languages, and parallel computing
inferred← citeshttps://doi.org/10.1109/mpcs.1994.367038openalex-snapshot
A parallel symbolic language for vision analysis
inferred← citeshttps://doi.org/10.1145/141471.141567openalex-snapshot
Dynamic program parallelization
inferred← citeshttps://doi.org/10.1145/141478.141567openalex-snapshot
Dynamic program parallelization
inferred← citeshttps://doi.org/10.1145/201059.201065openalex-snapshot
Supporting dynamic data structures on distributed-memory machines
inferred← citeshttps://doi.org/10.1145/237721.237724openalex-snapshot
Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C
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.