On the public citation graph

Pure type systems formalized

https://doi.org/10.1007/bfb0037113
0 signed · 83 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.1006/inco.1993.1038openalex-snapshot
Typing in Pure Type Systems
inferredcites →https://doi.org/10.1007/3-540-53982-4_9openalex-snapshot
Program specification and data refinement in type theory
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.1007/3-540-58085-9_71openalex-snapshot
Checking algorithms for Pure Type Systems
inferredcites →https://doi.org/10.1007/bfb0037095openalex-snapshot
A formalization of the strong normalization proof for System F in LEGO
inferredcites →https://doi.org/10.1017/cbo9780511569807.011openalex-snapshot
An algorithm for testing conversion in type theory
inferredcites →https://doi.org/10.1017/cbo9780511569883.007openalex-snapshot
A Mechanical Proof of the Church–Rosser Theorem
inferredcites →https://doi.org/10.1017/cbo9781139032636openalex-snapshot
Lambda Calculus with Types
inferredcites →https://doi.org/10.1017/s0956796800020025openalex-snapshot
Introduction to generalized type systems
inferredcites →https://doi.org/10.1017/s0956796800020037openalex-snapshot
Modular proof of strong normalization for the calculus of constructions
inferredcites →https://doi.org/10.1093/oso/9780198537618.003.0002openalex-snapshot
Lambda Calculi with Types
inferredcites →https://doi.org/10.1142/9789814368452_0004openalex-snapshot
The Constructive Engine
inferredcites →https://doi.org/10.1145/44483.44484openalex-snapshot
A mechanical proof of the Church-Rosser theorem

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.2001.2943openalex-snapshot
Foundations for Extensible Objects with Roles
inferred← citeshttps://doi.org/10.1007/10704567_5openalex-snapshot
Non-dependent Types for Standard ML Modules
inferred← citeshttps://doi.org/10.1007/10721959_33openalex-snapshot
A Formalization of a Concurrent Object Calculus up to α-Conversion
inferred← citeshttps://doi.org/10.1007/11814771_49openalex-snapshot
On the Strength of Proof-Irrelevant Type Theories
inferred← citeshttps://doi.org/10.1007/3-540-39185-1_14openalex-snapshot
The Not So Simple Proof-Irrelevant Model of CC
inferred← citeshttps://doi.org/10.1007/3-540-45842-5_8openalex-snapshot
A Kripke-Style Model for the Admissibility of Structural Rules
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-48959-2_14openalex-snapshot
Soundness of the Logical Framework for Its Typed Operational Semantic
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_71openalex-snapshot
Checking algorithms for Pure Type Systems
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-60579-7_10openalex-snapshot
Formalization of a λ-calculus with explicit substitutions in Coq
inferred← citeshttps://doi.org/10.1007/3-540-60579-7_4openalex-snapshot
The metatheory of UTT
inferred← citeshttps://doi.org/10.1007/3-540-60579-7_8openalex-snapshot
On extensibility of proof checkers
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_125openalex-snapshot
More Church-Rosser proofs (in Isabelle/HOL)
inferred← citeshttps://doi.org/10.1007/3-540-61780-9_70openalex-snapshot
An algorithm for checking incomplete proof objects in type theory with localization and unification
inferred← citeshttps://doi.org/10.1007/978-3-540-39993-3_16openalex-snapshot
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-85110-3_5openalex-snapshot
Mechanising a Proof of Craig’s Interpolation Theorem for Intuitionistic Logic in Nominal Isabelle
inferred← citeshttps://doi.org/10.1007/978-3-642-28869-2_22openalex-snapshot
GMeta: A Generic Formal Metatheory Framework for First-Order Representations
inferred← citeshttps://doi.org/10.1007/978-3-642-35308-6_15openalex-snapshot
Proof Pearl: Abella Formalization of λ-Calculus Cube Property
inferred← citeshttps://doi.org/10.1007/978-981-97-8943-6_3openalex-snapshot
Generic Reasoning of the Locally Nameless Representation
inferred← citeshttps://doi.org/10.1007/bfb0014053openalex-snapshot
Typed operational semantics
inferred← citeshttps://doi.org/10.1007/bfb0014065openalex-snapshot
A verified typechecker
inferred← citeshttps://doi.org/10.1007/bfb0028392openalex-snapshot
A full formalisation of π-calculus theory in the calculus of constructions
inferred← citeshttps://doi.org/10.1007/bfb0033834openalex-snapshot
An object calculus with algebraic rewriting
inferred← citeshttps://doi.org/10.1007/bfb0097799openalex-snapshot
Type inference verified: Algorithm W in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/bfb0105404openalex-snapshot
Five axioms of alpha-conversion
inferred← citeshttps://doi.org/10.1007/bfb0105414openalex-snapshot
Formal verification of algorithm W: The monomorphic case
inferred← citeshttps://doi.org/10.1007/s10817-011-9225-2openalex-snapshot
The Locally Nameless Representation
inferred← citeshttps://doi.org/10.1007/s10817-011-9229-yopenalex-snapshot
A Canonical Locally Named Representation of Binding
inferred← citeshttps://doi.org/10.1007/s10817-013-9287-4openalex-snapshot
Mechanizing Metatheory Without Typing Contexts
inferred← citeshttps://doi.org/10.1007/s10817-020-09553-0openalex-snapshot
HO$$\pi $$ in Coq
inferred← citeshttps://doi.org/10.1007/s10817-023-09672-4openalex-snapshot
Rensets and Renaming-Based Recursion for Syntax with Bindings Extended Version
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.ic.2004.01.001openalex-snapshot
Higher-order subtyping and its decidability
inferred← citeshttps://doi.org/10.1016/j.ic.2009.09.003openalex-snapshot
Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.01.010openalex-snapshot
External and internal syntax of the λ -calculus
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00062-2openalex-snapshot
Typed operational semantics for higher-order subtyping
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80882-xopenalex-snapshot
Operational Techniques in PVS — A Preliminary Evaluation
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82621-0openalex-snapshot
Types for Modules
inferred← citeshttps://doi.org/10.1017/s0956796800001106openalex-snapshot
Residual theory in λ-calculus: a formal development
inferred← citeshttps://doi.org/10.1017/s0956796802004653openalex-snapshot
A fully adequate shallow embedding of the π-calculus in Isabelle/HOL with mechanized syntax analysis
inferred← citeshttps://doi.org/10.1017/s0956796803004829openalex-snapshot
The view from the left
inferred← citeshttps://doi.org/10.1017/s0956796899003627openalex-snapshot
Type checking dependent (record) types and subtyping
inferred← citeshttps://doi.org/10.1023/a:1006277616879openalex-snapshot
Type Inference Verified: Algorithm W in Isabelle/HOL
inferred← citeshttps://doi.org/10.1023/a:1006294005493openalex-snapshot
Some Lambda Calculus and Type Theory Formalized
inferred← citeshttps://doi.org/10.1023/a:1006496715975openalex-snapshot
More Church–Rosser Proofs
inferred← citeshttps://doi.org/10.1023/a:1021923116629openalex-snapshot
Proof Reflection in Coq
inferred← citeshttps://doi.org/10.1023/a:1022527914293openalex-snapshot
Formalizing Strong Normalization Proofs of Explicit Substitution Calculi in ALF
inferred← citeshttps://doi.org/10.1023/a:1025689206562openalex-snapshot
Formal Foundations of Operational Semantics
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/1017472.1017477openalex-snapshot
Functional pearl
inferred← citeshttps://doi.org/10.1145/1328438.1328443openalex-snapshot
Engineering formal metatheory
inferred← citeshttps://doi.org/10.1145/1863495.1863497openalex-snapshot
Outrageous but meaningful coincidences
inferred← citeshttps://doi.org/10.1145/3158101openalex-snapshot
Unifying analytic and statically-typed quasiquotes
inferred← citeshttps://doi.org/10.1145/3408970openalex-snapshot
A general approach to define binders using matching logic
inferred← citeshttps://doi.org/10.1145/3756907.3756925openalex-snapshot
An interactive type checker for dependent types with general recursion (System Description)
inferred← citeshttps://doi.org/10.14257/astl.2013.41.10openalex-snapshot
Two Recent Approaches to Mechanical Developments of Formal Metatheory
inferred← citeshttps://doi.org/10.2178/bsl/1305810911openalex-snapshot
Foundations of Nominal Techniques: Logic and Semantics of Variables in Abstract Syntax
inferred← citeshttps://doi.org/10.2197/ipsjtrans.5.105openalex-snapshot
Verification of Substitution Theorem Using HOL
inferred← citeshttps://doi.org/10.3233/fi-1999-38401openalex-snapshot
A Subtyping for Extensible, Incomplete Objects
inferred← citeshttps://doi.org/10.4204/eptcs.402.6openalex-snapshot
More Church-Rosser Proofs in BELUGA
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.4230/lipics.fscd.2024.10openalex-snapshot
A general definition of dependent type theories
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.2107.11674openalex-snapshot
Case Studies in Formal Reasoning About Lambda-Calculus: Semantics, Church-Rosser, Standardization and HOAS
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/3754openalex-snapshot
Theoretical and implementation aspects in the mechanization of the metatheory of programming languages
inferred← citeshttps://doi.org/10.7146/brics.v4i18.18945openalex-snapshot
How to Believe a Machine-Checked Proof
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.