On the public citation graph
Staged compilation with two-level type theory
0 signed · 61 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/11417170_4openalex-snapshot
Untyped Algorithmic Equality for Martin-Löf’s Logical Framework with Surjective Pairs
inferredcites →https://doi.org/10.1007/978-3-030-34175-6_4openalex-snapshot
A Dependently Typed Multi-stage Calculus
inferredcites →https://doi.org/10.1007/978-3-319-07151-0_6openalex-snapshot
The Design and Implementation of BER MetaOCaml
inferredcites →https://doi.org/10.1016/0167-6423(95)00021-6openalex-snapshot
An algorithm for type-checking dependent types
inferredcites →https://doi.org/10.1016/0304-3975(85)90135-5openalex-snapshot
Automatic synthesis of typed Λ-programs on term algebras
inferredcites →https://doi.org/10.1016/j.tcs.2019.01.015openalex-snapshot
Canonicity and normalization for dependent type theory
inferredcites →https://doi.org/10.1016/s0304-3975(00)00053-0openalex-snapshot
MetaML and multi-stage programming with explicit annotations
inferredcites →https://doi.org/10.1017/cbo9780511526619openalex-snapshot
Semantics and Logics of Computation
inferredcites →https://doi.org/10.1109/lics.1999.782616openalex-snapshot
Semantical analysis of higher-order abstract syntax
inferredcites →https://doi.org/10.1109/lics52264.2021.9470719openalex-snapshot
Normalization for Cubical Type Theory
inferredcites →https://doi.org/10.1112/blms/6.1.115openalex-snapshot
CATEGORIES FOR THE WORKING MATHEMATICIAN
inferredcites →https://doi.org/10.1145/1863543.1863587openalex-snapshot
Scrapping your inefficient engine
inferredcites →https://doi.org/10.1145/2036918.2036920openalex-snapshot
Generic programming with indexed functors
inferredcites →https://doi.org/10.1145/2837614.2837638openalex-snapshot
Type theory in type theory using quotient inductive types
inferredcites →https://doi.org/10.1145/3158111openalex-snapshot
Decidability of conversion for type theory in type theory
inferredcites →https://doi.org/10.1145/3236795openalex-snapshot
Partially-static data as free extension of algebras
inferredcites →https://doi.org/10.1145/3290315openalex-snapshot
Constructing quotient inductive-inductive types
inferredcites →https://doi.org/10.1145/3293880.3294095openalex-snapshot
Eliminating Reflection from Type Theory: To the Legacy of Martin Hofmann
inferredcites →https://doi.org/10.1145/3371126openalex-snapshot
The fire triangle: how to mix substitution, dependent elimination, and effects
inferredcites →https://doi.org/10.1145/3373718.3394736openalex-snapshot
Multimodal Dependent Type Theory
inferredcites →https://doi.org/10.1145/3498700openalex-snapshot
Mœbius: metaprogramming using contextual types: the stage where system f can pattern match on itself
inferredcites →https://doi.org/10.1145/3498723openalex-snapshot
Staging with class: a specification for typed template Haskell
inferredcites →https://doi.org/10.1145/3545115openalex-snapshot
A Category Theoretic View of Contextual Types: From Simple Types to Dependent Types
inferredcites →https://doi.org/10.1145/382780.382785openalex-snapshot
A modal analysis of staged computation
inferredcites →https://doi.org/10.1145/636517.636528openalex-snapshot
Template meta-programming for Haskell
inferredcites →https://doi.org/10.15760/etd.5531openalex-snapshot
Fully Generic Programming Over Closed Universes of Inductive-Recursive Types
inferredcites →https://doi.org/10.2168/lmcs-7(2:4)2011openalex-snapshot
A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance
inferredcites →https://doi.org/10.23638/lmcs-13(4:1)2017openalex-snapshot
Normalisation by Evaluation for Type Theory, in Type Theory
inferredcites →https://doi.org/10.4230/lipics.csl.2016.24openalex-snapshot
Axioms for Modelling Cubical Type Theory in a Topos
inferredcites →https://doi.org/10.4230/lipics.csl.2020.14openalex-snapshot
Unifying Cubical Models of Univalent Type Theory
inferredcites →https://doi.org/10.4230/lipics.fscd.2018.22openalex-snapshot
Internal Universes in Models of Homotopy Type Theory
inferredcites →https://doi.org/10.4230/lipics.fscd.2019.25openalex-snapshot
Canonicity and normalisation for Dependent Type Theory
inferredcites →https://doi.org/10.5281/zenodo.6599900openalex-snapshot
Supplementary artifact for the paper "Staged Compilation With Two-Level Type Theory"
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-57262-3openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3_3openalex-snapshot
Layered Modal Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3_6openalex-snapshot
Generic bidirectional typing for dependent type theories
inferred← citeshttps://doi.org/10.1007/978-3-031-99751-8_13openalex-snapshot
Custom Representations of Inductive Families
inferred← citeshttps://doi.org/10.1017/s0960129523000130openalex-snapshot
Two-level type theory and applications
inferred← citeshttps://doi.org/10.1145/3607851openalex-snapshot
MacoCaml: Staging Composable and Compilable Macros
inferred← citeshttps://doi.org/10.1145/3632886openalex-snapshot
Internalizing Indistinguishability with Dependent Types
inferred← citeshttps://doi.org/10.1145/3635800.3636964openalex-snapshot
Scoped and Typed Staging by Evaluation
inferred← citeshttps://doi.org/10.1145/3674648openalex-snapshot
Closure-Free Functional Programming in a Two-Level Type Theory
inferred← citeshttps://doi.org/10.1145/3674649openalex-snapshot
Staged Compilation with Module Functors
inferred← citeshttps://doi.org/10.1145/3689484.3690731openalex-snapshot
Type-Safe Code Generation with Algebraic Effects and Handlers
inferred← citeshttps://doi.org/10.1145/3704253openalex-snapshot
Proceedings of the 2025 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation
inferred← citeshttps://doi.org/10.1145/3704253.3706138openalex-snapshot
Typed Program Analysis without Encodings
inferred← citeshttps://doi.org/10.1145/3704851openalex-snapshot
A Dependent Type Theory for Meta-programming with Intensional Analysis
inferred← citeshttps://doi.org/10.1145/3704912openalex-snapshot
All Your Base Are Belong to Us: Sort Polymorphism for Proof Assistants
inferred← citeshttps://doi.org/10.1145/3707203openalex-snapshot
A Layered Approach to Intensional Analysis in Type Theory
inferred← citeshttps://doi.org/10.1145/3759164.3759353openalex-snapshot
Staging Automatic Differentiation with Fusion
inferred← citeshttps://doi.org/10.1145/3776732openalex-snapshot
Bounded Sort Polymorphism with Elimination Constraints
inferred← citeshttps://doi.org/10.1145/3798260openalex-snapshot
Mechanised Semantics of Multi-stage Programming
inferred← citeshttps://doi.org/10.1145/3828676openalex-snapshot
Let It Be Optimized: Building Multi-stage Evaluators with Let-Insertion and Optimizations in Small Pieces (Functional Pearl)
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.