On the public citation graph
The taming of the rew: a type theory with computational assumptions
0 signed · 58 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.1006/inco.1995.1057openalex-snapshot
Parallel Reductions in λ-Calculus
inferredcites →https://doi.org/10.1007/11814771_50openalex-snapshot
Consistency and Completeness of Rewriting in the Calculus of Constructions
inferredcites →https://doi.org/10.1007/3-540-61254-8_26openalex-snapshot
Development closed critical pairs
inferredcites →https://doi.org/10.1007/978-3-540-73228-0_9openalex-snapshot
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
inferredcites →https://doi.org/10.1007/978-3-540-87531-4_1openalex-snapshot
The Computability Path Ordering: The End of a Quest
inferredcites →https://doi.org/10.1007/978-3-642-21691-6_5openalex-snapshot
Higher-Order Dynamic Pattern Unification for Dependent Types and Records
inferredcites →https://doi.org/10.1016/0304-3975(92)00023-kopenalex-snapshot
Confluence by decreasing diagrams
inferredcites →https://doi.org/10.1016/s0049-237x(08)71945-1openalex-snapshot
An Intuitionistic Theory of Types: Predicative Part
inferredcites →https://doi.org/10.1017/s0956796802004641openalex-snapshot
Termination of rewriting in the Calculus of Constructions
inferredcites →https://doi.org/10.1017/s0956796818000072openalex-snapshot
Size-based termination of higher-order rewriting
inferredcites →https://doi.org/10.1017/s095679689700289xopenalex-snapshot
Modularity of strong normalization in the algebraic-λ-cube
inferredcites →https://doi.org/10.1017/s0960129504004426openalex-snapshot
Definitions by rewriting in the Calculus of Constructions
inferredcites →https://doi.org/10.1109/lics.1988.5103openalex-snapshot
Combining algebra and higher-order types
inferredcites →https://doi.org/10.1109/lics.1991.151659openalex-snapshot
A computation model for executable higher-order algebraic specification languages
inferredcites →https://doi.org/10.1109/lics.1999.782635openalex-snapshot
The higher-order recursive path ordering
inferredcites →https://doi.org/10.1109/lics.2011.37openalex-snapshot
CoQMTU: A Higher-Order Type Theory with a Predicative Hierarchy of Universes Parametrized by a Decidable First-Order Theory
inferredcites →https://doi.org/10.1145/3158111openalex-snapshot
Decidability of conversion for type theory in type theory
inferredcites →https://doi.org/10.1145/3371076openalex-snapshot
Coq Coq correct! verification of type checking and erasure for Coq, in Coq
inferredcites →https://doi.org/10.1145/360204.360210openalex-snapshot
The size-change principle for program termination
inferredcites →https://doi.org/10.3233/fun-2005-681-201openalex-snapshot
Eliminating Introns in Ant Colony Programming
inferredcites →https://doi.org/10.3233/fun-2005-681-205openalex-snapshot
The Open Calculus of Constructions (Part I): An Equational Type Theory with Dependent Types for Programming, Specification, and Interactive Theorem Proving
inferredcites →https://doi.org/10.4230/lipics.fscd.2020.13openalex-snapshot
Type Safety of Rewrite Rules in Dependent Types
inferredcites →https://doi.org/10.4230/lipics.itcs.2018.56openalex-snapshot
A Homological Theory of Functions: Nonuniform Boolean Complexity Separation and VC Dimension Bound Via Algebraic Topology, and a Homological Farkas Lemma
inferredcites →https://doi.org/10.4230/lipics.rta.2010.17openalex-snapshot
Higher-Order (Non-)Modularity
inferredcites →https://doi.org/10.4230/lipics.rta.2013.174openalex-snapshot
Proof Orders for Decreasing Diagrams
inferredcites →https://doi.org/10.4230/lipics.tlca.2015.257openalex-snapshot
Termination of Dependently Typed Rewrite Rules
inferredcites →https://doi.org/10.4230/lipics.types.2018.1openalex-snapshot
Martin Hofmann’s Case for Non-Strictly Positive Data Types
inferredcites →https://doi.org/10.48550/arxiv.1304.0809openalex-snapshot
New Equations for Neutral Terms: A Sound and Complete Decision Procedure, Formalized
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-30044-8_5openalex-snapshot
Builtin Types Viewed as Inductive Families
inferred← citeshttps://doi.org/10.1007/978-3-031-34518-0_11openalex-snapshot
Confluence of Terminating Rewriting Computations
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_13openalex-snapshot
Definitional Functoriality for Dependent (Sub)Types
inferred← citeshttps://doi.org/10.1007/s10817-026-09753-0openalex-snapshot
The Rewster: Type Preserving Rewrite Rules for the Rocq Prover
inferred← citeshttps://doi.org/10.1017/s0960129526100516openalex-snapshot
A dependently-typed calculus of event telicity and culminativity
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470541openalex-snapshot
Types Are Internal ∞-Groupoids
inferred← citeshttps://doi.org/10.1145/3479394.3479403openalex-snapshot
Confluence in Non-Left-Linear Untyped Higher-Order Rewrite Theories
inferred← citeshttps://doi.org/10.1145/3674647openalex-snapshot
Dependent Ghosts Have a Reflection for Free
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/3747506openalex-snapshot
Frex: Dependently Typed Algebraic Simplification
inferred← citeshttps://doi.org/10.1145/3747535openalex-snapshot
Type Theory in Type Theory using a Strictified Syntax
inferred← citeshttps://doi.org/10.1145/3776685openalex-snapshot
Canonicity for Indexed Inductive-Recursive Types
inferred← citeshttps://doi.org/10.4204/eptcs.360.5openalex-snapshot
Sikkel: Multimode Simple Type Theory as an Agda Library
inferred← citeshttps://doi.org/10.46298/lmcs-18(1:17)2022openalex-snapshot
An extensible equality checking algorithm for dependent type theories
inferred← citeshttps://doi.org/10.48550/arxiv.2102.06513openalex-snapshot
Complete Bidirectional Typing for the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.48550/arxiv.2105.00024openalex-snapshot
Types are Internal $\infty$-Groupoids
inferred← citeshttps://doi.org/10.48550/arxiv.2108.10259openalex-snapshot
The Multiverse: Logical Modularity for Proof Assistants
inferred← citeshttps://doi.org/10.70675/9f1bc1e0z9d8az4296z8ee8zdcd60f5ddd06openalex-snapshot
Higher-Order Confluence and Universe Embedding in the Logical Framework
inferred← citeshttps://doi.org/10.70675/c1efe9f4z1500z4e67zaad4zcb5531cce150openalex-snapshot
Continuité en théorie des types
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.