On the public citation graph
A mixed modal/linear lambda calculus with applications to bellantoni-cook safe recursion
0 signed · 60 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1994.1013openalex-snapshot
An Extension of System F with Subtyping
inferredcites →https://doi.org/10.1007/3-540-62688-3_34openalex-snapshot
Primitive recursion for higher-order abstract syntax
inferredcites →https://doi.org/10.1007/bf01201998openalex-snapshot
A new recursion-theoretic characterization of the polytime functions
inferredcites →https://doi.org/10.1007/bfb0015256openalex-snapshot
Chu spaces and their interpretation as concurrent objects
inferredcites →https://doi.org/10.1007/bfb0022277openalex-snapshot
Ramified recurrence and computational complexity II: Substitution and poly-space
inferredcites →https://doi.org/10.1007/bfb0030611openalex-snapshot
Predicative functional recurrence and poly-space
inferredcites →https://doi.org/10.1016/0168-0072(92)90073-9openalex-snapshot
A game semantics for linear logic
inferredcites →https://doi.org/10.1109/lics.1991.151629openalex-snapshot
Games semantics for linear logic
inferredcites →https://doi.org/10.1145/115865.115894openalex-snapshot
Is there a use for linear logic?
inferredcites →https://doi.org/10.1145/237721.237788openalex-snapshot
A modal analysis of staged computation
inferredcites →https://doi.org/10.2307/421100openalex-snapshot
An Application of Category-Theoretic Semantics to the Characterisation of Complexity Classes Using Higher-Order Function Algebras
inferredcites →https://doi.org/10.3233/fi-1993-191-207openalex-snapshot
Lambda Calculus Characterizations of Poly-Time
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11965893_24openalex-snapshot
Structural Recursion on Ordered Trees and List-Based Complex Objects
inferred← citeshttps://doi.org/10.1007/3-540-45413-6_11openalex-snapshot
Ramied Recurrence with Dependent Types
inferred← citeshttps://doi.org/10.1007/3-540-49366-2_4openalex-snapshot
A Polymorphic Language Which Is Typable and Poly-step
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_41openalex-snapshot
Substructural Verification and Computational Feasibility
inferred← citeshttps://doi.org/10.1007/978-3-319-22177-9_24openalex-snapshot
On Equivalences, Metrics, and Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-540-24849-1_12openalex-snapshot
Higher-Order Linear Ramified Recurrence
inferred← citeshttps://doi.org/10.1007/978-3-642-02273-9_29openalex-snapshot
The Computational SLR: A Logic for Reasoning about Computational Indistinguishability
inferred← citeshttps://doi.org/10.1007/978-3-642-16280-0_3openalex-snapshot
A Calculus for Game-Based Security Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-32495-6_1openalex-snapshot
A Higher-Order Characterization of Probabilistic Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-662-54434-1_15openalex-snapshot
Probabilistic Termination by Monadic Affine Sized Typing
inferred← citeshttps://doi.org/10.1007/978-94-015-9620-6_8openalex-snapshot
Imposing Polynomial Time Complexity in Functional Programming
inferred← citeshttps://doi.org/10.1007/s00224-008-9110-5openalex-snapshot
Structural Recursion as a Query Language on Lists and Ordered Trees
inferred← citeshttps://doi.org/10.1016/j.ic.2014.10.008openalex-snapshot
Formal security proofs with minimal fuss: Implicit computational complexity at work
inferred← citeshttps://doi.org/10.1016/j.ic.2014.10.009openalex-snapshot
A higher-order characterization of probabilistic polynomial time
inferred← citeshttps://doi.org/10.1016/j.ic.2015.12.008openalex-snapshot
Higher-order interpretations and program complexity
inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00006-3openalex-snapshot
Higher type recursion, ramification and polynomial time
inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00010-5openalex-snapshot
Safe recursion with higher types and BCK-algebra
inferred← citeshttps://doi.org/10.1017/s0956796899003433openalex-snapshot
Semantics of linear/modal lambda calculus
inferred← citeshttps://doi.org/10.1017/s0960129510000265openalex-snapshot
The computational SLR: a logic for reasoning about computational indistinguishability
inferred← citeshttps://doi.org/10.1017/s0960129521000505openalex-snapshot
Implicit computation complexity in higher-order programming languages
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743523openalex-snapshot
A linguistic characterization of bounded oracle computation and probabilistic polynomial time
inferred← citeshttps://doi.org/10.1142/s0129054100000077openalex-snapshot
LIGHT AFFINE LOGIC AS A PROGRAMMING LANGUAGE: A FIRST CONTRIBUTION
inferred← citeshttps://doi.org/10.1142/s0129054101000394openalex-snapshot
LAMBDA-REPRESENTABLE FUNCTIONS OVER TERM ALGEBRAS
inferred← citeshttps://doi.org/10.1145/1480881.1480894openalex-snapshot
Formal certification of code-based cryptographic proofs
inferred← citeshttps://doi.org/10.1145/1866307.1866350openalex-snapshot
Computational indistinguishability logic
inferred← citeshttps://doi.org/10.1145/237721.237788openalex-snapshot
A modal analysis of staged computation
inferred← citeshttps://doi.org/10.1145/3293605openalex-snapshot
Probabilistic Termination by Monadic Affine Sized Typing
inferred← citeshttps://doi.org/10.1145/3371090openalex-snapshot
Seminaïve evaluation for a higher-order functional language
inferred← citeshttps://doi.org/10.1145/3661814.3662136openalex-snapshot
Primitive Recursive Dependent Type Theory
inferred← citeshttps://doi.org/10.1145/382780.382785openalex-snapshot
A modal analysis of staged computation
inferred← citeshttps://doi.org/10.2178/bsl/1122038991openalex-snapshot
Tiering as a Recursion Technique
inferred← citeshttps://doi.org/10.48550/arxiv.0712.4222openalex-snapshot
Weak Affine Light Typing: Polytime intensional expressivity, soundness and completeness
inferred← citeshttps://doi.org/10.48550/arxiv.0804.0660openalex-snapshot
Weak Affine Light Typing is complete with respect to Safe Recursion on Notation
inferred← citeshttps://doi.org/10.48550/arxiv.1202.3317openalex-snapshot
An Higher-Order Characterization of Probabilistic Polynomial Time (Long Version)
inferred← citeshttps://doi.org/10.48550/arxiv.1506.03710openalex-snapshot
On Equivalences, Metrics, and Polynomial Time (Long Version)
inferred← citeshttps://doi.org/10.48550/arxiv.1701.04089openalex-snapshot
Probabilistic Termination by Monadic Affine Sized Typing (Long Version)
inferred← citeshttps://doi.org/10.48550/arxiv.2007.01733openalex-snapshot
Probabilistic Soft Type Assignment
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/5573openalex-snapshot
Implicit computational complexity and probabilistic classes
inferred← citeshttps://doi.org/10.70675/2ba96c68z9506z47e0z8d13zf4cb43296358openalex-snapshot
Sized Types Methods and their Applications to Complexity Analysis in Pi-Calculus
inferred← citeshttps://doi.org/10.70675/3b66e61dz215dz4776z9e3fzb064d9a332dcopenalex-snapshot
Reusable static resource analyses for high level languages
inferred← citeshttps://doi.org/10.70675/3d9165ebz6ef8z466az84bbze0300e55d879openalex-snapshot
Non-laziness in implicit computational complexity and probabilistic λ-calculus
inferred← citeshttps://doi.org/10.7551/mitpress/1104.001.0001openalex-snapshot
Advanced Topics in Types and Programming Languages
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.