On the public citation graph

The relevance of proof-irrelevance

https://doi.org/10.1007/bfb0055099
0 signed · 28 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-60579-7_2openalex-snapshot
A short and flexible proof of strong normalization for the calculus of constructions
inferredcites →https://doi.org/10.1007/3-540-61377-3_30openalex-snapshot
Congruence Types
inferredcites →https://doi.org/10.1007/bfb0027010openalex-snapshot
Termination of algebraic type systems: The syntactic approach
inferredcites →https://doi.org/10.1007/bfb0040259openalex-snapshot
Inductively defined types in the Calculus of Constructions
inferredcites →https://doi.org/10.1016/0890-5401(88)90005-3openalex-snapshot
The calculus of constructions
inferredcites →https://doi.org/10.1016/0890-5401(92)90064-mopenalex-snapshot
Adding algebraic rewriting to the untyped lambda calculus
inferredcites →https://doi.org/10.1016/s0049-237x(08)70209-xopenalex-snapshot
Some Extensions of Automath: The AUT-4 Family
inferredcites →https://doi.org/10.1016/s0304-3975(96)00161-2openalex-snapshot
Abstract data type systems
inferredcites →https://doi.org/10.1016/s1571-0661(05)80170-7openalex-snapshot
A Notion of Classical Pure Type System (Preliminary version)
inferredcites →https://doi.org/10.1017/cbo9781139032636openalex-snapshot
Lambda Calculus with Types
inferredcites →https://doi.org/10.1017/s0956796800000952openalex-snapshot
A-translation and looping combinators in pure type systems
inferredcites →https://doi.org/10.1017/s0956796800020037openalex-snapshot
Modular proof of strong normalization for the calculus of constructions
inferredcites →https://doi.org/10.1017/s095679689700289xopenalex-snapshot
Modularity of strong normalization in the algebraic-λ-cube
inferredcites →https://doi.org/10.1109/lics.1988.5103openalex-snapshot
Combining algebra and higher-order types
inferredcites →https://doi.org/10.1109/lics.1991.151633openalex-snapshot
Partial objects in the calculus of constructions
inferredcites →https://doi.org/10.1109/lics.1992.185556openalex-snapshot
The Church-Rosser property for beta eta -reduction in typed lambda -calculi
inferredcites →https://doi.org/10.1109/lics.1994.316071openalex-snapshot
The groupoid model refutes uniqueness of identity proofs
inferredcites →https://doi.org/10.1145/96709.96714openalex-snapshot
A formulae-as-type notion of control

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11814771_49openalex-snapshot
On the Strength of Proof-Irrelevant Type Theories
inferred← citeshttps://doi.org/10.1007/3-540-49019-1_7openalex-snapshot
Expanding the Cube
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_26openalex-snapshot
Building Decision Procedures in the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.05.018openalex-snapshot
Inductive and Coinductive Components of Corecursive Functions in Coq
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80691-7openalex-snapshot
Monadic Type Systems: Pure Type Systems for Impure Settings (Preliminary Report)
inferred← citeshttps://doi.org/10.1145/2103786.2103797openalex-snapshot
Type systems for dummies
inferred← citeshttps://doi.org/10.4230/lipics.fscd.2022.25openalex-snapshot
Adequate and Computational Encodings in the Logical Framework Dedukti
inferred← citeshttps://doi.org/10.4230/lipics.tlca.2015.257openalex-snapshot
Termination of Dependently Typed Rewrite Rules
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0610068openalex-snapshot
Type theory and rewriting
inferred← citeshttps://doi.org/10.70675/1423c0dez59dez4873zac7fzc6cd90f116dbopenalex-snapshot
Generic bidirectional typing in a logical framework for dependent type theories
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.