On the public citation graph

From semantics to rules: A machine assisted analysis

https://doi.org/10.1007/bfb0049326
0 signed · 44 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/3-540-15648-8_28openalex-snapshot
Semantical analysis of specification logic
inferredcites →https://doi.org/10.1007/bfb0037100openalex-snapshot
Program extraction from normalization proofs
inferredcites →https://doi.org/10.1016/0168-0072(91)90067-vopenalex-snapshot
Kripke-style models for typed lambda calculus
inferredcites →https://doi.org/10.1016/0890-5401(91)90055-7openalex-snapshot
Inheritance as implicit coercion
inferredcites →https://doi.org/10.1016/s0019-9958(85)80001-2openalex-snapshot
Logical relations and the typed λ-calculus
inferredcites →https://doi.org/10.1016/s0049-237x(08)71685-9openalex-snapshot
Semantical Analysis of Intuitionistic Logic I
inferredcites →https://doi.org/10.1016/s0049-237x(08)71945-1openalex-snapshot
An Intuitionistic Theory of Types: Predicative Part
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.1145/96709.96712openalex-snapshot
Explicit substitutions
inferredcites →https://doi.org/10.2307/2268484openalex-snapshot
On the axiom of extensionality – Part I
inferredcites →https://doi.org/10.2307/2963897openalex-snapshot
On the axiom of extensionality, Part II

What points at this work

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

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-60164-3_27openalex-snapshot
Categorical reconstruction of a reduction free normalization proof
inferred← citeshttps://doi.org/10.1007/3-540-61780-9_61openalex-snapshot
Extracting a proof of coherence for monoidal categories from a proof of normalization for monoids
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_182openalex-snapshot
On explicit substitutions and names (extended abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-70594-9_4openalex-snapshot
Verifying a Semantic βη-Conversion Test for Martin-Löf Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-74464-1_3openalex-snapshot
On Constructive Cut Admissibility in Deduction Modulo
inferred← citeshttps://doi.org/10.1007/978-3-540-74591-4_27openalex-snapshot
Simple Types in Type Theory: Deep and Shallow Encodings
inferred← citeshttps://doi.org/10.1007/978-3-642-02261-6_17openalex-snapshot
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-22221-4_3openalex-snapshot
Polarized Classical Non-associative Lambek Calculus and Formal Semantics
inferred← citeshttps://doi.org/10.1007/978-3-662-48899-7_33openalex-snapshot
Normalisation by Completeness with Heyting Algebras
inferred← citeshttps://doi.org/10.1007/bfb0037100openalex-snapshot
Program extraction from normalization proofs
inferred← citeshttps://doi.org/10.1007/bfb0055521openalex-snapshot
Strong normalization by type-directed partial evaluation and run-time code generation
inferred← citeshttps://doi.org/10.1007/s11225-006-6604-5openalex-snapshot
Program Extraction from Normalization Proofs
inferred← citeshttps://doi.org/10.1016/j.apal.2010.04.007openalex-snapshot
Kripke models for classical logic
inferred← citeshttps://doi.org/10.1016/j.apal.2012.05.003openalex-snapshot
Continuation-passing style models complete for intuitionistic logic
inferred← citeshttps://doi.org/10.1017/s0956796819000170openalex-snapshot
POPLMark reloaded: Mechanizing proofs by logical relations
inferred← citeshttps://doi.org/10.1017/s0960129596002150openalex-snapshot
Intuitionistic model constructions and normalization proofs
inferred← citeshttps://doi.org/10.1017/s0960129597002508openalex-snapshot
Normalization and the Yoneda embedding
inferred← citeshttps://doi.org/10.1023/a:1022527914293openalex-snapshot
Formalizing Strong Normalization Proofs of Explicit Substitution Calculi in ALF
inferred← citeshttps://doi.org/10.1093/oso/9780198537816.003.0004openalex-snapshot
Martin-Löf ’s type theory
inferred← citeshttps://doi.org/10.1109/lics.1996.561309openalex-snapshot
Reduction-free normalisation for a polymorphic system
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/3338504.3357342openalex-snapshot
Simple Noninterference by Normalization
inferred← citeshttps://doi.org/10.1145/3354166.3354168openalex-snapshot
Normalization by Evaluation for Call-By-Push-Value and Polarized Lambda Calculus
inferred← citeshttps://doi.org/10.1145/3354166.3354185openalex-snapshot
Exponential Elimination for Bicartesian Closed Categorical Combinators
inferred← citeshttps://doi.org/10.1145/3471874.3472983openalex-snapshot
Practical normalization by evaluation for EDSLs
inferred← citeshttps://doi.org/10.1145/571157.571161openalex-snapshot
Semantic analysis of normalisation by evaluation for typed lambda calculus
inferred← citeshttps://doi.org/10.2307/2586554openalex-snapshot
A general formulation of simultaneous inductive-recursive definitions in type theory
inferred← citeshttps://doi.org/10.4204/eptcs.127.6openalex-snapshot
Type Directed Partial Evaluation for Level-1 Shift and Reset
inferred← citeshttps://doi.org/10.4230/lipics.rta.2012.133openalex-snapshot
A Semantic Proof that Reducibility Candidates entail Cut Elimination
inferred← citeshttps://doi.org/10.48550/arxiv.1106.0399openalex-snapshot
Focalization and phase models for classical extensions of non-associative Lambek calculus
inferred← citeshttps://doi.org/10.7146/brics.v4i43.18969openalex-snapshot
Strong Normalization by Type-Directed Partial Evaluation and Run-Time Code Generation (Preliminary Version)
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.