On the public citation graph
Irrelevance, Heterogeneous Equality, and Call-by-value Dependent Type Systems
0 signed · 42 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/1-4020-8141-3_34openalex-snapshot
Dynamic Typing with Dependent Types
inferredcites →https://doi.org/10.1007/3-540-45413-6_27openalex-snapshot
The Implicit Calculus of Constructions Extending Pure Type Systems with an Intersection Type Binder and Subtyping
inferredcites →https://doi.org/10.1007/978-3-540-24849-1_8openalex-snapshot
Inductive Families Need Not Store Their Indices
inferredcites →https://doi.org/10.1007/978-3-540-74464-1_9openalex-snapshot
Curry-Style Types for Nominal Terms
inferredcites →https://doi.org/10.1007/978-3-540-78499-9_25openalex-snapshot
Erasure and Polymorphism in Pure Type Systems
inferredcites →https://doi.org/10.1007/978-3-540-78499-9_26openalex-snapshot
The Implicit Calculus of Constructions as a Programming Language with Dependent Types
inferredcites →https://doi.org/10.1007/978-3-642-12251-4_5openalex-snapshot
ΠΣ: Dependent Types without the Sugar
inferredcites →https://doi.org/10.1007/978-3-642-19805-2_5openalex-snapshot
Irrelevance in Type Theory with a Heterogeneous Equality Judgement
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/j.entcs.2006.10.040openalex-snapshot
Type-level Computation Using Narrowing in Ωmega
inferredcites →https://doi.org/10.1093/oso/9780198537618.003.0002openalex-snapshot
Lambda Calculi with Types
inferredcites →https://doi.org/10.1109/lics.2001.932499openalex-snapshot
Intensionality, extensionality, and proof irrelevance in modal type theory
inferredcites →https://doi.org/10.1145/1159803.1159811openalex-snapshot
Simple unification-based type inference for GADTs
inferredcites →https://doi.org/10.1145/1190315.1190324openalex-snapshot
System F with type equality coercions
inferredcites →https://doi.org/10.1145/1706299.1706333openalex-snapshot
Dependent types and program equivalence
inferredcites →https://doi.org/10.1145/2034574.2034811openalex-snapshot
Secure distributed programming with value-dependent types
inferredcites →https://doi.org/10.1145/289423.289451openalex-snapshot
Cayenne—a language with dependent types
inferredcites →https://doi.org/10.1145/292540.292560openalex-snapshot
Dependent types in practical programming
inferredcites →https://doi.org/10.1184/r1/6587429openalex-snapshot
A Formulation of Dependent ML with Explicit Equality Proofs
inferredcites →https://doi.org/10.4204/eptcs.45.7openalex-snapshot
Equality, Quasi-Implicit Products, and Large Eliminations
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-319-08918-8_25openalex-snapshot
The Structural Theory of Pure Type Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-30936-1_22openalex-snapshot
A Delta for Hybrid Type Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-47958-3_14openalex-snapshot
Unified Syntax with Iso-types
inferred← citeshttps://doi.org/10.1007/978-3-642-21691-6_4openalex-snapshot
Combining Proofs and Programs
inferred← citeshttps://doi.org/10.1016/j.scico.2021.102655openalex-snapshot
A dependently typed calculus with polymorphic subtyping
inferred← citeshttps://doi.org/10.1145/2535838.2535883openalex-snapshot
Combining proofs and programs in a dependently typed language
inferred← citeshttps://doi.org/10.1145/3485485openalex-snapshot
Label dependent lambda calculus and gradual typing
inferred← citeshttps://doi.org/10.1145/3609027openalex-snapshot
Proceedings of the 8th ACM SIGPLAN International Workshop on Type-Driven Development
inferred← citeshttps://doi.org/10.1145/3609027.3609407openalex-snapshot
A Dependently Typed Language with Dynamic Equality
inferred← citeshttps://doi.org/10.17077/etd.vibd09toopenalex-snapshot
The semantic analysis of advanced 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.