On the public citation graph

Exact flow analysis

https://doi.org/10.1007/bfb0032746
0 signed · 38 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/malq.19810270205openalex-snapshot
Functional Characters of Solvable Terms
inferredcites →https://doi.org/10.1006/inco.1994.1046openalex-snapshot
The Type and Effect Discipline
inferredcites →https://doi.org/10.1007/3-540-57880-3_19openalex-snapshot
Polymorphic binding-time analysis
inferredcites →https://doi.org/10.1007/3-540-58485-4_55openalex-snapshot
Strictness and totality analysis
inferredcites →https://doi.org/10.1007/3-540-59293-8_216openalex-snapshot
Strictness and totality analysis with conjunction
inferredcites →https://doi.org/10.1007/3-540-60360-3_36openalex-snapshot
Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time
inferredcites →https://doi.org/10.1007/3-540-60360-3_40openalex-snapshot
Control-flow analysis and type systems
inferredcites →https://doi.org/10.1007/3540539816_70openalex-snapshot
A new technique for strictness analysis
inferredcites →https://doi.org/10.1007/bfb0017488openalex-snapshot
Global program analysis in constraint form
inferredcites →https://doi.org/10.1007/bfb0032746openalex-snapshot
Exact flow analysis
inferredcites →https://doi.org/10.1016/0167-6423(94)00004-2openalex-snapshot
Dynamic typing: syntax and proof theory
inferredcites →https://doi.org/10.1016/0304-3975(79)90007-0openalex-snapshot
The typed λ-calculus is not elementary recursive
inferredcites →https://doi.org/10.1145/143165.143205openalex-snapshot
Unboxed objects and polymorphic typing
inferredcites →https://doi.org/10.1145/174675.177874openalex-snapshot
Formally optimal boxing
inferredcites →https://doi.org/10.1145/199448.199533openalex-snapshot
A type system equivalent to flow analysis
inferredcites →https://doi.org/10.1145/199448.199536openalex-snapshot
A unified treatment of flow analysis in higher-order languages
inferredcites →https://doi.org/10.1145/258915.258939openalex-snapshot
Linear-time subtransitive control flow analysis
inferredcites →https://doi.org/10.1145/258948.258951openalex-snapshot
A modular, polyvariant and type-based closure analysis
inferredcites →https://doi.org/10.1145/263699.263745openalex-snapshot
Infinitary control flow analysis
inferredcites →https://doi.org/10.1145/41625.41638openalex-snapshot
On strictness and its analysis
inferredcites →https://doi.org/10.1145/73560.73564openalex-snapshot
Polymorphic effect systems
inferredcites →https://doi.org/10.1145/73560.73569openalex-snapshot
Automatic binding time analysis for a typed λ-calculus
inferredcites →https://doi.org/10.1145/99370.99390openalex-snapshot
Strictness analysis
inferredcites →https://doi.org/10.2307/2273659openalex-snapshot
A filter lambda model and the completeness of type assignment
inferredcites →https://doi.org/10.7146/dpb.v23i474.6947openalex-snapshot
Strictness and Totality Analysis

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-36377-7_10openalex-snapshot
Types in Program Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-31987-0_26openalex-snapshot
A Type System Equivalent to a Model Checker
inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_17openalex-snapshot
Flow Analysis, Linearity, and PTIME
inferred← citeshttps://doi.org/10.1007/978-3-642-41582-1_8openalex-snapshot
A Type- and Control-Flow Analysis for System F
inferred← citeshttps://doi.org/10.1017/s095679680100394xopenalex-snapshot
From Polyvariant flow information to intersection and union types
inferred← citeshttps://doi.org/10.1017/s0960129502003845openalex-snapshot
Modular control-flow analysis with rank 2 intersection types
inferred← citeshttps://doi.org/10.1017/s0960129502003857openalex-snapshot
Exact flow analysis
inferred← citeshttps://doi.org/10.1145/1291151.1291166openalex-snapshot
Relating complexity and precision in control flow analysis
inferred← citeshttps://doi.org/10.1145/1387673.1387678openalex-snapshot
A type system equivalent to a model checker
inferred← citeshttps://doi.org/10.1145/1411203.1411243openalex-snapshot
Deciding k CFA is complete for EXPTIME
inferred← citeshttps://doi.org/10.1145/268946.268963openalex-snapshot
From polyvariant flow information to intersection and union types
inferred← citeshttps://doi.org/10.1145/379605.379635openalex-snapshot
Type-based analysis and applications
showing the first 12 of 13 · page through all 13
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.