On the public citation graph

A Coq formalization of normalization by evaluation for Martin-Löf type theory

0 signed · 40 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/978-3-540-24727-2_13openalex-snapshot
A Denotational Account of Untyped Normalization by Evaluation
inferredcites →https://doi.org/10.1007/978-3-540-69407-6_39openalex-snapshot
Extraction in Coq: An Overview
inferredcites →https://doi.org/10.1007/978-3-540-74464-1_7openalex-snapshot
A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family
inferredcites →https://doi.org/10.1007/978-3-540-74591-4_27openalex-snapshot
Simple Types in Type Theory: Deep and Shallow Encodings
inferredcites →https://doi.org/10.1007/978-3-642-02273-9_3openalex-snapshot
A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance
inferredcites →https://doi.org/10.1007/978-3-642-12251-4_17openalex-snapshot
Towards Normalization by Evaluation for the βη-Calculus of Constructions
inferredcites →https://doi.org/10.1007/978-3-642-38946-7_13openalex-snapshot
Small Induction Recursion
inferredcites →https://doi.org/10.1007/978-3-662-07964-5openalex-snapshot
Interactive Theorem Proving and Program Development
inferredcites →https://doi.org/10.1007/s11225-006-6604-5openalex-snapshot
Program Extraction from Normalization Proofs
inferredcites →https://doi.org/10.1016/j.entcs.2007.02.025openalex-snapshot
Normalization by Evaluation for Martin-Löf Type Theory with One Universe
inferredcites →https://doi.org/10.1016/j.entcs.2007.09.023openalex-snapshot
Towards Formalizing Categorical Models of Type Theory in Type Theory
inferredcites →https://doi.org/10.1016/j.entcs.2009.07.084openalex-snapshot
Another Look at Function Domains
inferredcites →https://doi.org/10.1016/s0049-237x(08)70217-9openalex-snapshot
Strong Normalization in a Typed Lambda Calculus with Lambda Structured Types
inferredcites →https://doi.org/10.1017/s0956796800000186openalex-snapshot
Explicit substitutions
inferredcites →https://doi.org/10.1017/s0956796805005770openalex-snapshot
Pure type systems with judgemental equality
inferredcites →https://doi.org/10.1017/s096012950400427xopenalex-snapshot
Operational aspects of untyped Normalisation by Evaluation
inferredcites →https://doi.org/10.1017/s0960129596002150openalex-snapshot
Intuitionistic model constructions and normalization proofs
inferredcites →https://doi.org/10.1093/oso/9780198501275.003.0010openalex-snapshot
An intuitionistic theory of types
inferredcites →https://doi.org/10.1109/lics.1991.151645openalex-snapshot
An inverse of the evaluation functional for typed lambda -calculus
inferredcites →https://doi.org/10.1109/lics.2007.33openalex-snapshot
Normalization by Evaluation for Martin-Löf Type Theory with Typed Equality Judgements
inferredcites →https://doi.org/10.2307/2586554openalex-snapshot
A general formulation of simultaneous inductive-recursive definitions in type theory
inferredcites →https://doi.org/10.4204/eptcs.153.4openalex-snapshot
Normalization by Evaluation in the Delay Monad: A Case Study for Coinduction via Copatterns and Sized Types
inferredcites →https://doi.org/10.4230/lipics.fscd.2016.6openalex-snapshot
Normalisation by Evaluation for Dependent Types

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-030-33636-3_12openalex-snapshot
Shallow Embedding of Type Theory is Morally Correct
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-981-97-8943-6_4openalex-snapshot
Building a Correct-by-Construction Type Checker for a Dependently Typed Core Language
inferred← citeshttps://doi.org/10.1016/j.scico.2020.102512openalex-snapshot
Mechanization of coherence and adequacy: Being extrinsic extended to subtyping
inferred← citeshttps://doi.org/10.1017/s0956796823000060openalex-snapshot
Normalization by evaluation for modal dependent type theory
inferred← citeshttps://doi.org/10.1142/9789811236488_0008openalex-snapshot
The Braga Method: Extracting Certified Algorithms from Complex Recursive Schemes in Coq
inferred← citeshttps://doi.org/10.1145/3341711openalex-snapshot
Implementing a modal dependent type theory
inferred← citeshttps://doi.org/10.1145/3408983openalex-snapshot
Elaboration with first-class implicit function types
inferred← citeshttps://doi.org/10.1145/3636501.3636951openalex-snapshot
Martin-Löf à la Coq
inferred← citeshttps://doi.org/10.1145/3704843openalex-snapshot
Consistency of a Dependent Calculus of Indistinguishability
inferred← citeshttps://doi.org/10.1145/3704851openalex-snapshot
A Dependent Type Theory for Meta-programming with Intensional Analysis
inferred← citeshttps://doi.org/10.1145/3747508openalex-snapshot
Normalization by Evaluation for Non-cumulativity
inferred← citeshttps://doi.org/10.1145/3747511openalex-snapshot
McTT: A Verified Kernel for a Proof Assistant
inferred← citeshttps://doi.org/10.1145/3776672openalex-snapshot
Algorithmic Conversion with Surjective Pairing: A Syntactic and Untyped Approach
inferred← citeshttps://doi.org/10.1145/3779031.3779085openalex-snapshot
Mechanizing Synthetic Tait Computability in Istari
inferred← citeshttps://doi.org/10.1145/3779031.3779087openalex-snapshot
A Certifying Proof Assistant for Synthetic Mathematics in Lean
inferred← citeshttps://doi.org/10.15476/elte.2022.070openalex-snapshot
Type-Theoretic Signatures for Algebraic Theories and Inductive 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.