On the public citation graph

Approximate normalization for gradual dependent types

0 signed · 53 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-09510-1_15openalex-snapshot
Proving termination with multiset orderings
inferredcites →https://doi.org/10.1007/978-3-642-00590-9_1openalex-snapshot
Well-Typed Programs Can’t Be Blamed
inferredcites →https://doi.org/10.1007/978-3-642-28869-2_29openalex-snapshot
Gradual Ownership Types
inferredcites →https://doi.org/10.1007/978-3-662-07964-5openalex-snapshot
Interactive Theorem Proving and Program Development
inferredcites →https://doi.org/10.1016/0890-5401(88)90005-3openalex-snapshot
The calculus of constructions
inferredcites →https://doi.org/10.1017/s0956796807006430openalex-snapshot
Mechanizing metatheory in a logical framework
inferredcites →https://doi.org/10.1017/s095679681300018xopenalex-snapshot
Idris, a general-purpose dependently typed programming language: Design and implementation
inferredcites →https://doi.org/10.1017/s0956796817000053openalex-snapshot
The calculus of dependent lambda eliminations
inferredcites →https://doi.org/10.1017/s0956796818000011openalex-snapshot
Foundations of dependent interoperability
inferredcites →https://doi.org/10.1093/logcom/13.5.639openalex-snapshot
A Linear Spine Calculus
inferredcites →https://doi.org/10.1109/csf.2013.22openalex-snapshot
Gradual Security Typing with References
inferredcites →https://doi.org/10.1145/1086365.1086375openalex-snapshot
Combining programming with theorem proving
inferredcites →https://doi.org/10.1145/1352582.1352591openalex-snapshot
Contextual modal type theory
inferredcites →https://doi.org/10.1145/138027.138060openalex-snapshot
A framework for defining logics
inferredcites →https://doi.org/10.1145/1389449.1389469openalex-snapshot
Programming with proofs and explicit contexts
inferredcites →https://doi.org/10.1145/1411204.1411212openalex-snapshot
AURA
inferredcites →https://doi.org/10.1145/1481861.1481862openalex-snapshot
Dependently typed programming in Agda
inferredcites →https://doi.org/10.1145/1706299.1706342openalex-snapshot
Threesomes, with and without blame
inferredcites →https://doi.org/10.1145/2103776.2103779openalex-snapshot
Dependent interoperability
inferredcites →https://doi.org/10.1145/2535838.2535883openalex-snapshot
Combining proofs and programs in a dependently typed language
inferredcites →https://doi.org/10.1145/2837614.2837655openalex-snapshot
Dependent types and multi-monadic effects in F*
inferredcites →https://doi.org/10.1145/2837614.2837670openalex-snapshot
Abstracting gradual typing
inferredcites →https://doi.org/10.1145/292540.292560openalex-snapshot
Dependent types in practical programming
inferredcites →https://doi.org/10.1145/2951913.2951933openalex-snapshot
Partial type equivalences for verified dependent interoperability
inferredcites →https://doi.org/10.1145/3009837.3009856openalex-snapshot
Gradual refinement types
inferredcites →https://doi.org/10.1145/3093333.3009849openalex-snapshot
Big types in little runtime: open-world soundness and collaborative blame for gradual type systems
inferredcites →https://doi.org/10.1145/3110282openalex-snapshot
Gradual session types
inferredcites →https://doi.org/10.1145/3229061openalex-snapshot
Type-Driven Gradual Security with References
inferredcites →https://doi.org/10.1145/3236766openalex-snapshot
A spectrum of type soundness and performance
inferredcites →https://doi.org/10.1145/3290327openalex-snapshot
Live functional programming with typed holes
inferredcites →https://doi.org/10.1145/3314221.3314643openalex-snapshot
Size-change termination as a contract: dynamically and statically enforcing termination for higher-order programs
inferredcites →https://doi.org/10.1145/3341692openalex-snapshot
Approximate normalization for gradual dependent types
inferredcites →https://doi.org/10.1145/345099.345100openalex-snapshot
Local type inference
inferredcites →https://doi.org/10.3233/fi-2010-304openalex-snapshot
A Tutorial Implementation of a Dependently Typed Lambda Calculus
inferredcites →https://doi.org/10.7551/mitpress/9153.001.0001openalex-snapshot
Certified Programming with 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-89159-6_21openalex-snapshot
GATE: Gradual Effect Types
inferred← citeshttps://doi.org/10.1007/978-3-031-30044-8_8openalex-snapshot
Gradual Tensor Shape Checking
inferred← citeshttps://doi.org/10.1017/s0956796821000125openalex-snapshot
Gradual type theory
inferred← citeshttps://doi.org/10.1017/s0956796821000241openalex-snapshot
Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi
inferred← citeshttps://doi.org/10.1145/3462172.3462190openalex-snapshot
A Declarative Gradualizer with Language Transformations
inferred← citeshttps://doi.org/10.1145/3485485openalex-snapshot
Label dependent lambda calculus and gradual typing
inferred← citeshttps://doi.org/10.1145/3495528openalex-snapshot
Gradualizing the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1145/3547627openalex-snapshot
Propositional equality for gradual dependently typed programming
inferred← citeshttps://doi.org/10.1145/3547655openalex-snapshot
A reasonably gradual type theory
inferred← citeshttps://doi.org/10.1145/3555986openalex-snapshot
Gradual System F
inferred← citeshttps://doi.org/10.1145/3586048openalex-snapshot
Live Pattern Matching with Typed Holes
inferred← citeshttps://doi.org/10.1145/3609027.3609407openalex-snapshot
A Dependently Typed Language with Dynamic Equality
inferred← citeshttps://doi.org/10.1145/3618305.3623594openalex-snapshot
Partial Gradual Dependent Type Theory
inferred← citeshttps://doi.org/10.1145/3674644openalex-snapshot
Gradual Indexed Inductive Types
inferred← citeshttps://doi.org/10.1145/3704808openalex-snapshot
Gradual C0: Symbolic Execution for Gradual Verification
inferred← citeshttps://doi.org/10.1145/3763068openalex-snapshot
Incremental Certified Programming
inferred← citeshttps://doi.org/10.1145/3794763.3794812openalex-snapshot
The Way of Types: A Report on Developer Experience with Type-Driven Development
showing the first 17 of 18 · page through all 18
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.