On the public citation graph

Detecting and removing dead-code using rank 2 intersection

https://doi.org/10.1007/bfb0097787
0 signed · 31 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.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-61739-6_39openalex-snapshot
Refinement types for program analysis
inferredcites →https://doi.org/10.1007/3-540-62688-3_33openalex-snapshot
An inference algorithm for strictness
inferredcites →https://doi.org/10.1007/bfb0014045openalex-snapshot
Using subtyping in program optimization
inferredcites →https://doi.org/10.1007/bfb0014550openalex-snapshot
On strictness and totality
inferredcites →https://doi.org/10.1016/0167-6423(95)00012-7openalex-snapshot
Lazy type inference and program analysis
inferredcites →https://doi.org/10.1016/s0747-7171(08)80139-3openalex-snapshot
Extraction of redundancy-free programs from constructive natural deduction proofs
inferredcites →https://doi.org/10.1017/cbo9780511526619.007openalex-snapshot
Operationally-Based Theories of Program Equivalence
inferredcites →https://doi.org/10.1093/logcom/6.5.663openalex-snapshot
Pruning simply typed -terms
inferredcites →https://doi.org/10.1145/174675.177858openalex-snapshot
Deriving algorithms from type inference systems
inferredcites →https://doi.org/10.1145/199448.199533openalex-snapshot
A type system equivalent to flow analysis
inferredcites →https://doi.org/10.1145/203095.203096openalex-snapshot
Covariance and contravariance
inferredcites →https://doi.org/10.1145/75277.75285openalex-snapshot
Extracting ω's programs from proofs in the calculus of constructions
inferredcites →https://doi.org/10.1145/99370.99390openalex-snapshot
Strictness analysis
inferredcites →https://doi.org/10.1305/ndjfl/1093883253openalex-snapshot
An extension of the basic functionality theory for the $\lambda$-calculus.
inferredcites →https://doi.org/10.2307/2273659openalex-snapshot
A filter lambda model and the completeness of type assignment
inferredcites →https://doi.org/10.25959/23242532openalex-snapshot
Reduction types and intensionality in the lambda-calculus
inferredcites →https://doi.org/10.7146/dpb.v24i498.7026openalex-snapshot
Annotated Type Systems for Program 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-45350-4_13openalex-snapshot
Type-Based Useless-Code Elimination for Functional Programs Position Paper
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_22openalex-snapshot
A Formalization of Static Analyses in System F
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_8openalex-snapshot
Useless-Code Detection and Elimination for PCF with Algebraic Data Types
inferred← citeshttps://doi.org/10.1007/978-3-642-21691-6_19openalex-snapshot
Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.08.017openalex-snapshot
Semantic Types and Approximation for Featherweight Java
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80776-xopenalex-snapshot
Rank 2 Types for Term Graph Rewriting
inferred← citeshttps://doi.org/10.1017/s0956796800003786openalex-snapshot
Automatic useless-code elimination for HOT functional programs
inferred← citeshttps://doi.org/10.1017/s0960129502003845openalex-snapshot
Modular control-flow analysis with rank 2 intersection types
inferred← citeshttps://doi.org/10.1017/s0960129502003869openalex-snapshot
A conjunctive type system for useless-code elimination
inferred← citeshttps://doi.org/10.1109/lics.2000.855775openalex-snapshot
A static calculus of dependencies for the λ-cube
inferred← citeshttps://doi.org/10.1145/1868281.1868283openalex-snapshot
On the rôle of minimal typing derivations in type-driven program transformation
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.59.930.916openalex-snapshot
Analysing Anti-patterns Static Relationships with Design Patterns
inferred← citeshttps://doi.org/10.2969/msjmemoirs/00201c040openalex-snapshot
Inference based analyses of functional programs: dead-code and strictness
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.