On the public citation graph
A formalization of the strong normalization proof for System F in LEGO
0 signed · 60 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.1016/1385-7258(72)90034-0openalex-snapshot
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
inferredcites →https://doi.org/10.1109/lics.1989.39193openalex-snapshot
ECC, an extended calculus of constructions
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
inferredcites →https://doi.org/10.3233/fi-1993-191-208openalex-snapshot
On the Undecidability of Partial Polymorphic Type Reconstruction
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11532231_4openalex-snapshot
Nominal Techniques in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/11617990_4openalex-snapshot
Extracting a Normalization Algorithm in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/3-540-44557-9_11openalex-snapshot
Formalising Formulas-as-Types-as-Objects
inferred← citeshttps://doi.org/10.1007/3-540-45842-5_11openalex-snapshot
On the Proofs of Some Formally Unprovable Propositions and Prototype Proofs in Type Theory
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_32openalex-snapshot
Monadic Presentations of Lambda Terms Using Generalized Inductive Types
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_15openalex-snapshot
Mechanized Operational Semantics via (Co)Induction
inferred← citeshttps://doi.org/10.1007/3-540-57826-9_152openalex-snapshot
A mechanisation of name-carrying syntax up to alpha-conversion
inferred← citeshttps://doi.org/10.1007/3-540-58085-9_82openalex-snapshot
Closure under alpha-conversion
inferred← citeshttps://doi.org/10.1007/3-540-58450-1_60openalex-snapshot
Representing higher-order logic proofs in HOL
inferred← citeshttps://doi.org/10.1007/3-540-58555-9_108openalex-snapshot
An experimental support system for formal mathematical reasoning
inferred← citeshttps://doi.org/10.1007/3-540-60579-7_10openalex-snapshot
Formalization of a λ-calculus with explicit substitutions in Coq
inferred← citeshttps://doi.org/10.1007/978-3-642-17172-7_1openalex-snapshot
Programming Inductive Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-32784-1_12openalex-snapshot
Permutations in Coinductive Graph Representation
inferred← citeshttps://doi.org/10.1007/s00153-002-0156-9openalex-snapshot
Short proofs of normalization for the simply- typed λ-calculus, permutative conversions and Gödel's T
inferred← citeshttps://doi.org/10.1007/s00200-009-0105-5openalex-snapshot
Coq formalization of the higher-order recursive path ordering
inferred← citeshttps://doi.org/10.1007/s10817-008-9097-2openalex-snapshot
Nominal Techniques in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/s10817-010-9165-2openalex-snapshot
A Formalization of the Knuth–Bendix(–Huet) Critical Pair Theorem
inferred← citeshttps://doi.org/10.1007/s10817-011-9230-5openalex-snapshot
A Solution to the PoplMark Challenge Based on de Bruijn Indices
inferred← citeshttps://doi.org/10.1007/s10817-018-9483-3openalex-snapshot
Mechanized Metatheory Revisited
inferred← citeshttps://doi.org/10.1016/j.apal.2015.08.002openalex-snapshot
An intuitionistic version of Ramsey's Theorem and its use in Program Termination
inferred← citeshttps://doi.org/10.1016/j.apal.2016.06.001openalex-snapshot
Reverse mathematical bounds for the Termination Theorem
inferred← citeshttps://doi.org/10.1016/j.apal.2025.103555openalex-snapshot
Proof-theoretic methods in quantifier-free definability
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.01.021openalex-snapshot
A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.09.014openalex-snapshot
Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.11.009openalex-snapshot
Normalization for the Simply-Typed Lambda-Calculus in Twelf
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.049openalex-snapshot
A PVS Theory for Term Rewriting Systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00281-6openalex-snapshot
A Third-Order Representation of the λμ-Calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)81004-1openalex-snapshot
A New Machine-checked Proof of Strong Normalisation for Display Logic
inferred← citeshttps://doi.org/10.1017/s0956796800001106openalex-snapshot
Residual theory in λ-calculus: a formal development
inferred← citeshttps://doi.org/10.1017/s0956796809007266openalex-snapshot
Implementing a normalizer using sized heterogeneous types
inferred← citeshttps://doi.org/10.1017/s0956796812000251openalex-snapshot
A unified treatment of syntax with binders
inferred← citeshttps://doi.org/10.1017/s0956796819000170openalex-snapshot
POPLMark reloaded: Mechanizing proofs by logical relations
inferred← citeshttps://doi.org/10.1017/s0960129518000154openalex-snapshot
Mechanizing proofs with logical relations – Kripke-style
inferred← citeshttps://doi.org/10.1023/a:1006294005493openalex-snapshot
Some Lambda Calculus and Type Theory Formalized
inferred← citeshttps://doi.org/10.1109/lics.2010.48openalex-snapshot
Strong Normalization for System F by HOAS on Top of FOAS
inferred← citeshttps://doi.org/10.1112/s1461157000000188openalex-snapshot
A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs
inferred← citeshttps://doi.org/10.1145/1328438.1328443openalex-snapshot
Engineering formal metatheory
inferred← citeshttps://doi.org/10.1145/1411203.1411226openalex-snapshot
Parametric higher-order abstract syntax for mechanized semantics
inferred← citeshttps://doi.org/10.1145/1577824.1577834openalex-snapshot
Formalizing a strong normalization proof for Moggi's computational metalanguage
inferred← citeshttps://doi.org/10.1145/2631172.2631177openalex-snapshot
A Generic Approach to Proofs about Substitution
inferred← citeshttps://doi.org/10.1145/2966268.2966269openalex-snapshot
Mechanizing Proofs about Mendler-style Recursion
inferred← citeshttps://doi.org/10.14236/ewic/msfp2006.3openalex-snapshot
Implementing a Normalizer Using Sized Heterogeneous Types
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.39.649openalex-snapshot
Coinductive Graph Representation: the Problem of Embedded Lists
inferred← citeshttps://doi.org/10.4204/eptcs.185.3openalex-snapshot
A Case Study on Logical Relations using Contextual Types
inferred← citeshttps://doi.org/10.4204/eptcs.449.15openalex-snapshot
A Machine-checked Proof of Consistency for Impredicative Pure Type Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1512.08622openalex-snapshot
Reverse Mathematical Bounds for the Termination Theorem
inferred← citeshttps://doi.org/10.48550/arxiv.1805.07176openalex-snapshot
Proofs and Programs about Open Terms
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0607058openalex-snapshot
Craig's Interpolation Theorem formalised and mechanised in Isabelle/HOL
inferred← citeshttps://doi.org/10.6100/ir637480openalex-snapshot
Termination of rewriting and its certification
inferred← citeshttps://doi.org/10.7146/brics.v4i51.19272openalex-snapshot
Some Lambda Calculus and Type Theory Formalized
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.