On the public citation graph

Reduction types and intensionality in the lambda-calculus

https://doi.org/10.25959/23242532
0 signed · 22 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-16446-4_1openalex-snapshot
Strictness analysis and polymorphic invariance
inferredcites →https://doi.org/10.1007/3-540-18088-5_3openalex-snapshot
Inverse image analysis
inferredcites →https://doi.org/10.1007/978-1-4471-3166-3_2openalex-snapshot
Backwards Strictness Analysis: Proved and Improved
inferredcites →https://doi.org/10.1007/bfb0022505openalex-snapshot
An extended polymorphic type system for applicative languages
inferredcites →https://doi.org/10.1016/0890-5401(91)90020-3openalex-snapshot
Type inference with recursive types: Syntax and semantics
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.2307/2273659openalex-snapshot
A filter lambda model and the completeness of type assignment
inferredcites →https://doi.org/10.2307/2306226openalex-snapshot
The Mathematical Analysis of Logic.

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-44622-2_28openalex-snapshot
Elimination of Negation in a Logical Framework
inferred← citeshttps://doi.org/10.1007/3-540-57264-3_46openalex-snapshot
Usage analysis with natural reduction types
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_216openalex-snapshot
Strictness and totality analysis with conjunction
inferred← citeshttps://doi.org/10.1007/3-540-62688-3_33openalex-snapshot
An inference algorithm for strictness
inferred← citeshttps://doi.org/10.1007/bf01019007openalex-snapshot
Type theory and projections for static analysis
inferred← citeshttps://doi.org/10.1007/bfb0014550openalex-snapshot
On strictness and totality
inferred← citeshttps://doi.org/10.1007/bfb0097787openalex-snapshot
Detecting and removing dead-code using rank 2 intersection
inferred← citeshttps://doi.org/10.1017/s0956796800003786openalex-snapshot
Automatic useless-code elimination for HOT functional programs
inferred← citeshttps://doi.org/10.1145/773184.773196openalex-snapshot
Trust in the pi-calculus
inferred← citeshttps://doi.org/10.1145/937555.937559openalex-snapshot
Higher-order pattern complement and the strict λ-calculus
inferred← citeshttps://doi.org/10.25959/23214203openalex-snapshot
Integrity Analysis and Coercion in Distributed Systems
inferred← citeshttps://doi.org/10.2969/msjmemoirs/00201c040openalex-snapshot
Inference based analyses of functional programs: dead-code and strictness
inferred← citeshttps://doi.org/10.7551/mitpress/4304.003.0034openalex-snapshot
The Relative Complement Problem for Higher-Order Patterns
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.