On the public citation graph
Dependently Typed Records in Type Theory
0 signed · 48 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-48167-2_9openalex-snapshot
Modular Structures as Dependent Types in Isabelle
inferredcites →https://doi.org/10.1007/3-540-56625-2openalex-snapshot
Mathematics of Program Construction
inferredcites →https://doi.org/10.1007/3-540-56625-2_1openalex-snapshot
Extended calculus of constructions as a specification language
inferredcites →https://doi.org/10.1007/3-540-57182-5_3openalex-snapshot
Deliverables: a categorical approach to program development in type theory
inferredcites →https://doi.org/10.1016/0167-8051(82)90048-1openalex-snapshot
Proceedings of the international conference on fifth-generation computer systems
inferredcites →https://doi.org/10.1016/0890-5401(88)90011-9openalex-snapshot
Pebble, a kernel language for modules and abstract data types
inferredcites →https://doi.org/10.1017/s0956796800001933openalex-snapshot
A syntactic theory of type generativity and sharing
inferredcites →https://doi.org/10.1093/oso/9780198501275.001.0001openalex-snapshot
Twenty Five Years of Constructive Type Theory
inferredcites →https://doi.org/10.1093/oso/9780198501275.003.0004openalex-snapshot
Extension of Martin-Löf’s type theory with record types and subtyping
inferredcites →https://doi.org/10.1093/oso/9780198538356.001.0001openalex-snapshot
Computation and Reasoning
inferredcites →https://doi.org/10.1145/174675.176926openalex-snapshot
Manifest types, modules, and separate compilation
inferredcites →https://doi.org/10.1145/174675.176927openalex-snapshot
A type-theoretic approach to higher-order modules with sharing
inferredcites →https://doi.org/10.1145/263699.263742openalex-snapshot
Typing algorithm in type theory with inheritance
inferredcites →https://doi.org/10.1145/512644.512670openalex-snapshot
Using dependent types to express modular structure
inferredcites →https://doi.org/10.2307/2586554openalex-snapshot
A general formulation of simultaneous inductive-recursive definitions in type theory
inferredcites →https://doi.org/10.5860/choice.32-5698openalex-snapshot
Computation and reasoning: a type theory for computer science
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-44904-3_4openalex-snapshot
Inductive Types in the Calculus of Algebraic Constructions
inferred← citeshttps://doi.org/10.1007/3-540-44904-3_8openalex-snapshot
A Logical Framework with Dependently Typed Records
inferred← citeshttps://doi.org/10.1007/978-3-030-51054-1_8openalex-snapshot
Validating Mathematical Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-68103-8_11openalex-snapshot
Working with Mathematical Structures in Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-69149-5_55openalex-snapshot
Programming with Proofs: Language-Based Approaches to Totally Correct Software
inferred← citeshttps://doi.org/10.1007/978-3-642-02444-3_15openalex-snapshot
Manifest Fields and Module Mechanisms in Intensional Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-03359-9_23openalex-snapshot
Packaging Mathematical Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-32347-8_25openalex-snapshot
A Language of Patterns for Subterm Selection
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.11.017openalex-snapshot
Imperative LF Meta-Programming
inferred← citeshttps://doi.org/10.1017/9781108770750.015openalex-snapshot
Tabular: Probabilistic Inference from the Spreadsheet
inferred← citeshttps://doi.org/10.1017/s0960129505004901openalex-snapshot
A computational view of implicit coercions in type theory
inferred← citeshttps://doi.org/10.1017/s0960129511000119openalex-snapshot
Type classes for mathematics in type theory
inferred← citeshttps://doi.org/10.1145/1086365.1086400openalex-snapshot
A language-based approach to functionally correct imperative programming
inferred← citeshttps://doi.org/10.1145/1090189.1086400openalex-snapshot
A language-based approach to functionally correct imperative programming
inferred← citeshttps://doi.org/10.1145/1735813.1735819openalex-snapshot
Dependent record types revisited
inferred← citeshttps://doi.org/10.1145/1863495.1863497openalex-snapshot
Outrageous but meaningful coincidences
inferred← citeshttps://doi.org/10.1145/2951913openalex-snapshot
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:18)2012openalex-snapshot
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions
inferred← citeshttps://doi.org/10.2168/lmcs-9(1:1)2013openalex-snapshot
Type classes for efficient exact real arithmetic in Coq
inferred← citeshttps://doi.org/10.31979/etd.scu4-q8t7openalex-snapshot
Case Studies in Proof Checking
inferred← citeshttps://doi.org/10.3765/salt.v0i20.2580openalex-snapshot
Type-theoretical semantics with coercive subtyping
inferred← citeshttps://doi.org/10.3765/salt.v20i0.2580openalex-snapshot
Type-theoretical semantics with coercive subtyping
inferred← citeshttps://doi.org/10.4204/eptcs.53.2openalex-snapshot
Nonuniform Coercions via Unification Hints
inferred← citeshttps://doi.org/10.4204/eptcs.53.3openalex-snapshot
Typed Operational Semantics for Dependent Record Types
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0610070openalex-snapshot
Inductive types in the Calculus of Algebraic Constructions
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/917openalex-snapshot
Interactive theorem provers: issues faced as a user and tackled as a developer
inferred← citeshttps://doi.org/10.70675/c6b17cccza22az483fzb582z72db9c2f683aopenalex-snapshot
Automated verification of termination certificates
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.