On the public citation graph

Code optimizations for lazy evaluation

https://doi.org/10.1007/bf01806169
0 signed · 55 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.
Claim with ORCID
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.
See reference health

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/3-540-09981-6_19openalex-snapshot
The theory and practice of transforming call-by-need into call-by-value
inferredcites →https://doi.org/10.1007/3-540-15975-4_50openalex-snapshot
The G-machine: A fast, graph-reduction evaluator
inferredcites →https://doi.org/10.1007/3-540-16446-4_3openalex-snapshot
The theory of strictness analysis for higher order functions
inferredcites →https://doi.org/10.1007/3-540-16446-4_7openalex-snapshot
Strictness detection in non-flat domains
inferredcites →https://doi.org/10.1007/3-540-18317-5_21openalex-snapshot
Projections for strictness analysis
inferredcites →https://doi.org/10.1007/3-540-18317-5_3openalex-snapshot
Tim: A simple, lazy abstract machine to execute supercombinators
inferredcites →https://doi.org/10.1007/3-540-19020-1_26openalex-snapshot
Path semantics
inferredcites →https://doi.org/10.1016/0096-0551(81)90077-1openalex-snapshot
Functional programming: Application and implementation
inferredcites →https://doi.org/10.1016/0141-9331(87)90510-2openalex-snapshot
The implementation of functional programming languages
inferredcites →https://doi.org/10.1016/0307-904x(80)90170-5openalex-snapshot
Functional programming: application and implementation
inferredcites →https://doi.org/10.1016/0950-5849(88)90032-8openalex-snapshot
Abstract interpretation of declarative languages
inferredcites →https://doi.org/10.1109/sfcs.1980.16openalex-snapshot
Complexity of flow analysis, inductive assertion synthesis and a language due to Dijkstra
inferredcites →https://doi.org/10.1145/13310.13333openalex-snapshot
ORBIT: an optimizing compiler for scheme
inferredcites →https://doi.org/10.1145/15022.15026openalex-snapshot
On some extensions of syntactic error recovery technique based on phrase markers
inferredcites →https://doi.org/10.1145/15042.15043openalex-snapshot
Revised 3 report on the algorithmic language scheme
inferredcites →https://doi.org/10.1145/290229.290234openalex-snapshot
Revised 5 report on the algorithmic language scheme
inferredcites →https://doi.org/10.1145/319838.319869openalex-snapshot
Implementing functional languages in the Categorical Abstract Machine
inferredcites →https://doi.org/10.1145/41625.41637openalex-snapshot
Compiling strictness into streams
inferredcites →https://doi.org/10.1145/4472.4478openalex-snapshot
MULTILISP: a language for concurrent symbolic computation
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/512644.512653openalex-snapshot
Higher-order strictness analysis in untyped lambda calculus
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.1145/73560.73570openalex-snapshot
A collecting interpretation of expressions
inferredcites →https://doi.org/10.1145/989393.989414openalex-snapshot
Orbit

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-55844-6_127openalex-snapshot
Path analysis for lazy data structures
inferred← citeshttps://doi.org/10.1007/3-540-58485-4_56openalex-snapshot
Fast strictness analysis via symbolic fixpoint iteration
inferred← citeshttps://doi.org/10.1007/3540543961_5openalex-snapshot
Multi-thread code generation for dataflow architectures from non-strict programs
inferred← citeshttps://doi.org/10.1007/978-1-4471-3196-0_9openalex-snapshot
Evaluation Order Analysis for Lazy Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-36946-9_4openalex-snapshot
Notions of Aliasing and Ownership
inferred← citeshttps://doi.org/10.1007/bf01019945openalex-snapshot
Call-by-need and continuation-passing style
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90112-bopenalex-snapshot
Obtaining lazy evaluation with continuations in scheme
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00120-2openalex-snapshot
Order-of-demand analysis for lazy languages
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90110-fopenalex-snapshot
A uniform treatment of order of evaluation and aggregate update
inferred← citeshttps://doi.org/10.1017/s0956796800000137openalex-snapshot
Implementing the evaluation transformer model of reduction on parallel machines
inferred← citeshttps://doi.org/10.1017/s0956796800000289openalex-snapshot
A practical functional program for the CRAY X-MP
inferred← citeshttps://doi.org/10.1017/s0956796800000319openalex-snapshot
Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
inferred← citeshttps://doi.org/10.1017/s0956796897002748openalex-snapshot
Thunks and the λ-calculus
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/tpds.2017.2778161openalex-snapshot
Loop Tiling in Large-Scale Stencil Codes at Run-Time with OPS
inferred← citeshttps://doi.org/10.1145/1011508.1011509openalex-snapshot
First-class monadic schedules
inferred← citeshttps://doi.org/10.1145/114005.102806openalex-snapshot
Automatic transformation of series expressions into loops
inferred← citeshttps://doi.org/10.1145/1238844.1238856openalex-snapshot
A history of Haskell
inferred← citeshttps://doi.org/10.1145/141471.141568openalex-snapshot
Global analysis for partitioning non-strict programs into sequential threads
inferred← citeshttps://doi.org/10.1145/1863543.1863584openalex-snapshot
A certified framework for compiling and executing garbage-collected languages
inferred← citeshttps://doi.org/10.1145/1932681.1863584openalex-snapshot
A certified framework for compiling and executing garbage-collected languages
inferred← citeshttps://doi.org/10.1145/199448.199528openalex-snapshot
Monad transformers and modular interpreters
inferred← citeshttps://doi.org/10.1145/224164.224185openalex-snapshot
First-class schedules and virtual maps
inferred← citeshttps://doi.org/10.1145/72551.72554openalex-snapshot
Conception, evolution, and application of functional programming languages
inferred← citeshttps://doi.org/10.1145/99370.99376openalex-snapshot
Compilation as partitioning: a new approach to compiling non-strict functional languages
inferred← citeshttps://doi.org/10.18637/jss.v087.i04openalex-snapshot
Database-Inspired Optimizations for Statistical Analysis
inferred← citeshttps://doi.org/10.4230/lipics.ecoop.2021.15openalex-snapshot
AutoGraph: Imperative-style Coding with Graph-based Performance
inferred← citeshttps://doi.org/10.48550/arxiv.1308.0158openalex-snapshot
First-Class Functions for First-Order Database Engines
inferred← citeshttps://doi.org/10.5194/gmd-12-4729-2019openalex-snapshot
OpenArray v1.0: a simple operator library for the decoupling of ocean modeling and parallel computing
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.