On the public citation graph

Untyped Algorithmic Equality for Martin-Löf’s Logical Framework with Surjective Pairs

https://doi.org/10.1007/11417170_4
0 signed · 39 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.1998.2750openalex-snapshot
Perpetual Reductions inλ-Calculus
inferredcites →https://doi.org/10.1007/11417170_4openalex-snapshot
Untyped Algorithmic Equality for Martin-Löf’s Logical Framework with Surjective Pairs
inferredcites →https://doi.org/10.1007/3-540-44622-2_19openalex-snapshot
Disjunctive Tautologies as Synchronisation Schemes
inferredcites →https://doi.org/10.1007/3-540-44904-3_8openalex-snapshot
A Logical Framework with Dependently Typed Records
inferredcites →https://doi.org/10.1007/3-540-48959-2_14openalex-snapshot
Soundness of the Logical Framework for Its Typed Operational Semantic
inferredcites →https://doi.org/10.1007/978-3-540-30124-0_32openalex-snapshot
Subtyping Union Types
inferredcites →https://doi.org/10.1007/978-3-540-31982-5_26openalex-snapshot
Justifying Algorithms for βη-Conversion
inferredcites →https://doi.org/10.1007/978-3-540-73228-0_19openalex-snapshot
Extensional Rewriting with Sums
inferredcites →https://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
inferredcites →https://doi.org/10.1016/0167-6423(95)00021-6openalex-snapshot
An algorithm for type-checking dependent types
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/s1571-0661(04)80503-6openalex-snapshot
A Simplified Account of the Metatheory of Linear LF
inferredcites →https://doi.org/10.1017/cbo9780511569807.011openalex-snapshot
An algorithm for testing conversion in type theory
inferredcites →https://doi.org/10.1017/s0956796805005770openalex-snapshot
Pure type systems with judgemental equality
inferredcites →https://doi.org/10.1051/ita:2004015openalex-snapshot
Termination checking with types
inferredcites →https://doi.org/10.1093/oso/9780198537816.003.0004openalex-snapshot
Martin-Löf ’s type theory
inferredcites →https://doi.org/10.1145/1040305.1040312openalex-snapshot
A syntactic approach to eta equality in type theory
inferredcites →https://doi.org/10.1145/1042038.1042041openalex-snapshot
On equivalence and canonical forms in the LF type theory
inferredcites →https://doi.org/10.1145/138027.138060openalex-snapshot
A framework for defining logics
inferredcites →https://doi.org/10.1145/268946.268967openalex-snapshot
Local type inference
inferredcites →https://doi.org/10.1145/351240.351259openalex-snapshot
Intersection types and computational effects
inferredcites →https://doi.org/10.2178/jsl/1102022211openalex-snapshot
Higher-order semantics and extensionality
inferredcites →https://doi.org/10.2307/2272645openalex-snapshot
The λ-calculus is ω-incomplete
inferredcites →https://doi.org/10.2307/2273659openalex-snapshot
A filter lambda model and the completeness of type assignment
inferredcites →https://doi.org/10.2307/2274784openalex-snapshot
Introduction to Higher Order Categorical Logic.
inferredcites →https://doi.org/10.2307/2586554openalex-snapshot
A general formulation of simultaneous inductive-recursive definitions in type theory

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11559306_17openalex-snapshot
Connecting a Logical Framework to a First-Order Logic Prover
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3_6openalex-snapshot
Generic bidirectional typing for dependent type theories
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-642-19805-2_5openalex-snapshot
Irrelevance in Type Theory with a Heterogeneous Equality Judgement
inferred← citeshttps://doi.org/10.1109/lics.2007.33openalex-snapshot
Normalization by Evaluation for Martin-Löf Type Theory with Typed Equality Judgements
inferred← citeshttps://doi.org/10.1109/lics.2015.22openalex-snapshot
Polarised Intermediate Representation of Lambda Calculus with Sums
inferred← citeshttps://doi.org/10.1145/3547641openalex-snapshot
Staged compilation with two-level type theory
inferred← citeshttps://doi.org/10.1145/3715095openalex-snapshot
Generic Bidirectional Typing for Dependent Type Theories
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:29)2012openalex-snapshot
On Irrelevance and Algorithmic Equality in Predicative Type Theory
inferred← citeshttps://doi.org/10.4204/eptcs.34.3openalex-snapshot
Explicit Substitutions for Contextual Type Theory
inferred← citeshttps://doi.org/10.48550/arxiv.2102.06513openalex-snapshot
Complete Bidirectional Typing for the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.70675/1423c0dez59dez4873zac7fzc6cd90f116dbopenalex-snapshot
Generic bidirectional typing in a logical framework for dependent type theories
showing the first 12 of 13 · page through all 13
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.