On the public citation graph
Proof-functional connectives and realizability
0 signed · 30 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.1007/3-540-54345-7_49openalex-snapshot
Strong conjunction and intersection types
inferredcites →https://doi.org/10.1016/0304-3975(92)90306-zopenalex-snapshot
Intersection types for combinatory logic
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/s0019-9958(82)80087-9openalex-snapshot
What is a model of the lambda calculus?
inferredcites →https://doi.org/10.1016/s0049-237x(08)71541-6openalex-snapshot
The Semantics of Entailment
inferredcites →https://doi.org/10.1016/s0049-237x(08)71819-6openalex-snapshot
Extended Type Structures and Filter Lambda Models
inferredcites →https://doi.org/10.1017/s095679680000006xopenalex-snapshot
Using types as search keys in function libraries
inferredcites →https://doi.org/10.1017/s0960129500001444openalex-snapshot
Provable isomorphisms of types
inferredcites →https://doi.org/10.1145/22145.22175openalex-snapshot
Provable isomorphisms and domain equations in models of typed languages
inferredcites →https://doi.org/10.1305/ndjfl/1093635158openalex-snapshot
The completeness of provable realizability.
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
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-52411-0_20openalex-snapshot
Natural constructive proofs of A via A -> B, proof paradoxes, and impredicativity
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.1017/s0960129505004871openalex-snapshot
A short survey of isomorphisms of types
inferred← citeshttps://doi.org/10.1017/s0960129518000105openalex-snapshot
Plugging-in proof development environments usingLocksinLF
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.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.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.