On the public citation graph

Taylor subsumes Scott, Berry, Kahn and Plotkin

0 signed · 62 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-57208-2_1openalex-snapshot
The lambda-calculus with multiplicities
inferredcites →https://doi.org/10.1007/3-540-59200-8_63openalex-snapshot
Proving the genericity lemma by leftmost reduction is simple
inferredcites →https://doi.org/10.1007/978-3-540-70590-1_29openalex-snapshot
Reduction Under Substitution
inferredcites →https://doi.org/10.1007/978-3-642-03816-7_49openalex-snapshot
A General Class of Models of $\mathcal{H}^*$
inferredcites →https://doi.org/10.1007/s10485-013-9312-0openalex-snapshot
Differential Structure, Tangent Structure, and SDG
inferredcites →https://doi.org/10.1007/s10990-006-0480-6openalex-snapshot
Call-by-push-value: Decomposing call-by-value and call-by-name
inferredcites →https://doi.org/10.1016/0304-3975(75)90017-1openalex-snapshot
Call-by-name, call-by-value and the λ-calculus
inferredcites →https://doi.org/10.1016/j.apal.2011.09.008openalex-snapshot
A relational semantics for parallelism and non-determinism in a functional setting
inferredcites →https://doi.org/10.1016/j.entcs.2014.10.014openalex-snapshot
Relational Graph Models, Taylor Expansion and Extensionality
inferredcites →https://doi.org/10.1016/j.entcs.2018.10.003openalex-snapshot
(In)Efficiency and Reasonable Cost Models
inferredcites →https://doi.org/10.1016/j.jocs.2011.10.007openalex-snapshot
Algorithmic differentiation in Python with AlgoPy
inferredcites →https://doi.org/10.1016/j.tcs.2006.08.003openalex-snapshot
Differential interaction nets
inferredcites →https://doi.org/10.1016/j.tcs.2008.06.001openalex-snapshot
Uniformity and the Taylor expansion of ordinary lambda-terms
inferredcites →https://doi.org/10.1016/s0049-237x(08)71129-7openalex-snapshot
The Type Free Lambda Calculus
inferredcites →https://doi.org/10.1016/s0049-237x(13)72052-4openalex-snapshot
Studies in Logic and the Foundations of Mathematics
inferredcites →https://doi.org/10.1016/s0304-3975(03)00392-xopenalex-snapshot
The differential lambda-calculus
inferredcites →https://doi.org/10.1016/s1571-0661(04)80083-5openalex-snapshot
Bisimulation in Untyped Lambda Calculus:
inferredcites →https://doi.org/10.1017/s0956796899003548openalex-snapshot
Applications of Plotkin-terms: partitions and morphisms for closed terms
inferredcites →https://doi.org/10.1017/s0960129502003729openalex-snapshot
On Köthe sequence spaces and linear logic
inferredcites →https://doi.org/10.1017/s0960129506005676openalex-snapshot
Differential categories
inferredcites →https://doi.org/10.1017/s0960129509990089openalex-snapshot
The algebraic lambda calculus
inferredcites →https://doi.org/10.1017/s0960129515000316openalex-snapshot
Essential and relational models
inferredcites →https://doi.org/10.1017/s0960129515000493openalex-snapshot
Practical coinduction
inferredcites →https://doi.org/10.1017/s0960129516000372openalex-snapshot
An introduction to differential linear logic: proof-nets, models and antiderivatives
inferredcites →https://doi.org/10.1017/s0960129516000396openalex-snapshot
Execution time of λ-terms via denotational semantics and intersection types
inferredcites →https://doi.org/10.1017/s0960129518000014openalex-snapshot
Integral categories and calculus categories
inferredcites →https://doi.org/10.1051/ita/2012012openalex-snapshot
Probabilistic operational semantics for the lambda calculus
inferredcites →https://doi.org/10.1080/10556788.2017.1333613openalex-snapshot
Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization
inferredcites →https://doi.org/10.1080/10556788.2017.1378653openalex-snapshot
Integrating Lipschitzian dynamical systems using piecewise algorithmic differentiation
inferredcites →https://doi.org/10.1093/logcom/14.3.373openalex-snapshot
The Lattice of Lambda Theories
inferredcites →https://doi.org/10.1109/lics.2013.36openalex-snapshot
Weighted Relational Models of Typed Lambda-Calculi
inferredcites →https://doi.org/10.1109/lics.2019.8785809openalex-snapshot
A Probabilistic and Non-Deterministic Call-by-Push-Value Language
inferredcites →https://doi.org/10.1112/jlms/jdm096openalex-snapshot
The cartesian closed bicategory of generalised species of structures
inferredcites →https://doi.org/10.1137/0205036openalex-snapshot
The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
inferredcites →https://doi.org/10.1145/2535838.2535879openalex-snapshot
Applying quantitative semantics to higher-order quantum computing
inferredcites →https://doi.org/10.1145/2967973.2968608openalex-snapshot
The Bang Calculus
inferredcites →https://doi.org/10.1145/3209108.3209126openalex-snapshot
Probabilistic Böhm Trees and Probabilistic Separation
inferredcites →https://doi.org/10.1145/3209108.3209157openalex-snapshot
Species, Profunctors and Taylor Expansion Weighted by SMCC
inferredcites →https://doi.org/10.1145/3236789openalex-snapshot
Tight typings and split bounds
inferredcites →https://doi.org/10.2307/2272645openalex-snapshot
The λ-calculus is ω-incomplete
inferredcites →https://doi.org/10.23638/lmcs-16(3:6)2020openalex-snapshot
Revisiting Call-by-value B\"ohm trees in light of their Taylor expansion
inferredcites →https://doi.org/10.4204/eptcs.292.2openalex-snapshot
The Bang Calculus and the Two Girard's Translations
inferredcites →https://doi.org/10.4230/lipics.csl.2012.259openalex-snapshot
Collapsing non-idempotent intersection types
inferredcites →https://doi.org/10.4230/lipics.ecoop.2019.25openalex-snapshot
Automatic differentiation in machine learning: a survey
inferredcites →https://doi.org/10.4230/lipics.fscd.2019.13openalex-snapshot
On the Taylor Expansion of Probabilistic $λ$-Terms (Long Version)
inferredcites →https://doi.org/10.48550/arxiv.1607.04690openalex-snapshot
Probabilistic call by push value
inferredcites →https://doi.org/10.70930/tac/y9rglypbopenalex-snapshot
Cartesian Differential Categories

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-15298-6openalex-snapshot
Logic, Language, Information, and Computation
inferred← citeshttps://doi.org/10.1007/978-3-031-57231-9openalex-snapshot
Foundations of Software Science and Computation Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-57231-9_2openalex-snapshot
Light Genericity
inferred← citeshttps://doi.org/10.1017/s0960129523000129openalex-snapshot
Coherent differentiation
inferred← citeshttps://doi.org/10.1017/s0960129525000040openalex-snapshot
Coherent Taylor expansion as a bimonad
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175681openalex-snapshot
From Thin Concurrent Games to Generalized Species of Structures
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175753openalex-snapshot
Taylor Expansion as a Monad in Models of DiLL
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00045openalex-snapshot
The Qualitative Collapse of Concurrent Games
inferred← citeshttps://doi.org/10.1145/3531130.3532469openalex-snapshot
Resource approximation for the λμ-calculus
inferred← citeshttps://doi.org/10.1145/3661814.3662106openalex-snapshot
δ is for Dialectica
inferred← citeshttps://doi.org/10.1145/3661814.3662113openalex-snapshot
Genericity Through Stratification
inferred← citeshttps://doi.org/10.46298/lmcs-18(1:1)2022openalex-snapshot
On the Taylor expansion of $\lambda$-terms and the groupoid structure of their rigid approximants
inferred← citeshttps://doi.org/10.46298/lmcs-18(2:4)2022openalex-snapshot
Gluing resource proof-structures: inhabitation and inverting the Taylor expansion
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:34)2023openalex-snapshot
Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications
inferred← citeshttps://doi.org/10.70675/d0680a12zfb6ez4cbdzae51z43d98d5b093copenalex-snapshot
Intersection types and ressource calculi in the denotational semantics of lambda-calculus
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.