On the public citation graph

Proof functional connectives

0 signed · 27 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/bfb0066739openalex-snapshot

Metamathematical Investigation of Intuitionistic Arithmetic and Analysis

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1995.1086openalex-snapshot

Intersection and Union Types: Syntax and Semantics

inferred← citeshttps://doi.org/10.1007/3-540-54345-7_49openalex-snapshot

Strong conjunction and intersection types

inferred← citeshttps://doi.org/10.1007/978-3-031-61716-4_2openalex-snapshot

YACC: Yet Another Church Calculus

inferred← citeshttps://doi.org/10.1007/978-3-319-47958-3_11openalex-snapshot

A Realizability Interpretation for Intersection and Union Types

inferred← citeshttps://doi.org/10.1007/978-3-319-68953-1_7openalex-snapshot

A Decidable Subtyping Logic for Intersection and Union Types

inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_18openalex-snapshot

The Inhabitation Problem for Rank Two Intersection Types

inferred← citeshttps://doi.org/10.1007/978-3-642-02273-9_26openalex-snapshot

Inhabitation of Low-Rank Intersection Types

inferred← citeshttps://doi.org/10.1007/bf01203032openalex-snapshot

Proof-functional connectives and realizability

inferred← citeshttps://doi.org/10.1007/bf01211394openalex-snapshot

Types with intersection: An introduction

inferred← citeshttps://doi.org/10.1016/0168-0072(94)90034-5openalex-snapshot

Combining type disciplines

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.03.026openalex-snapshot

Expansion: the Crucial Mechanism for Type Inference with Intersection Types: A Survey and Explanation

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.046openalex-snapshot

A typed lambda calculus with intersection types

inferred← citeshttps://doi.org/10.1017/s0956796813000270openalex-snapshot

Elaborating intersection and union types

inferred← citeshttps://doi.org/10.1017/s0960129500001444openalex-snapshot

Provable isomorphisms of types

inferred← citeshttps://doi.org/10.1093/logcom/4.2.109openalex-snapshot

Intersection Types as Logical Formulae

inferred← citeshttps://doi.org/10.1109/lics.1994.316059openalex-snapshot

The emptiness problem for intersection types

inferred← citeshttps://doi.org/10.1145/1013963.1013980openalex-snapshot

Type inference with expansion variables and intersection types in system E and an exact correspondence with β-reduction

inferred← citeshttps://doi.org/10.1145/3130261.3130262openalex-snapshot

Towards a Logical Framework with Intersection and Union Types

inferred← citeshttps://doi.org/10.1305/ndjfl/1039724889openalex-snapshot

The "Relevance" of Intersection and Union Types

inferred← citeshttps://doi.org/10.2969/msjmemoirs/00201c020openalex-snapshot

Intersection Types, $\lambda$-models, and Böhm Trees

inferred← citeshttps://doi.org/10.3233/fi-2012-778openalex-snapshot

Intersection Types from a Proof-theoretic Perspective

inferred← citeshttps://doi.org/10.4230/lipics.fscd.2019.28openalex-snapshot

The Delta-calculus: Syntax and Types

inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2018.37openalex-snapshot

The Delta-Framework

inferred← citeshttps://doi.org/10.48550/arxiv.2002.10803openalex-snapshot

A Type Checker for a Logical Framework with Union and Intersection Types

inferred← citeshttps://doi.org/10.70675/22ef231fzd622z41a8z8ea5z8b29a2998b2copenalex-snapshot

Contrôle du calcul et limites du sens : fonctions, computation et types de G. Frege à A.Church

inferred← citeshttps://doi.org/10.70675/e161fb97z1fe2z4e3ez926dzfbaa8dbfdd17openalex-snapshot

Combining union, intersection and dependent types in an explicitely typed 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.