On the public citation graph

A theory of higher-order subtyping with type intervals

https://doi.org/10.1145/3473574
0 signed · 52 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.1994.1013openalex-snapshot
An Extension of System F with Subtyping
inferredcites →https://doi.org/10.1006/inco.1994.1093openalex-snapshot
A Syntactic Approach to Type Soundness
inferredcites →https://doi.org/10.1007/3-540-48168-0_30openalex-snapshot
Anti-Symmetry of Higher-Order Subtyping
inferredcites →https://doi.org/10.1007/3-540-48959-2_27openalex-snapshot
Pure Type Systems with Subtyping
inferredcites →https://doi.org/10.1007/3-540-54415-1_73openalex-snapshot
An extension of system F with subtyping
inferredcites →https://doi.org/10.1007/978-3-319-30936-1_14openalex-snapshot
The Essence of Dependent Object Types
inferredcites →https://doi.org/10.1007/978-3-540-24849-1_23openalex-snapshot
A Concurrent Logical Framework: The Propositional Fragment
inferredcites →https://doi.org/10.1007/978-3-540-87531-4_32openalex-snapshot
Syntactic Metatheory of Higher-Order Subtyping
inferredcites →https://doi.org/10.1007/978-3-662-46669-8_28openalex-snapshot
Full Reduction in the Face of Absurdity
inferredcites →https://doi.org/10.1007/bfb0022246openalex-snapshot
Decidability of higher-order subtyping with intersection types
inferredcites →https://doi.org/10.1016/s0304-3975(00)00175-4openalex-snapshot
Subtyping dependent types
inferredcites →https://doi.org/10.1016/s0304-3975(96)00096-5openalex-snapshot
Higher-order subtyping
inferredcites →https://doi.org/10.1016/s0890-5401(03)00062-2openalex-snapshot
Typed operational semantics for higher-order subtyping
inferredcites →https://doi.org/10.1017/cbo9781139032636openalex-snapshot
Lambda Calculus with Types
inferredcites →https://doi.org/10.1017/s0956796800000198openalex-snapshot
A semantic basis for Quest
inferredcites →https://doi.org/10.1017/s0956796805005770openalex-snapshot
Pure type systems with judgemental equality
inferredcites →https://doi.org/10.1017/s0956796807006430openalex-snapshot
Mechanizing metatheory in a logical framework
inferredcites →https://doi.org/10.1017/s0960129500001134openalex-snapshot
Coherence of subsumption, minimum typing and type-checking in F ≤
inferredcites →https://doi.org/10.1017/s0960129508006853openalex-snapshot
Polarised subtyping for sized types
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/1190215.1190245openalex-snapshot
Towards a mechanized metatheory of standard ML
inferredcites →https://doi.org/10.1145/1190216.1190245openalex-snapshot
Towards a mechanized metatheory of standard ML
inferredcites →https://doi.org/10.1145/143165.143228openalex-snapshot
Bounded quantification is undecidable
inferredcites →https://doi.org/10.1145/1449764.1449798openalex-snapshot
Generics of a higher kind
inferredcites →https://doi.org/10.1145/1449955.1449798openalex-snapshot
Generics of a higher kind
inferredcites →https://doi.org/10.1145/1577824.1577829openalex-snapshot
A syntactic account of singleton types via hereditary substitution
inferredcites →https://doi.org/10.1145/174675.176927openalex-snapshot
A type-theoretic approach to higher-order modules with sharing
inferredcites →https://doi.org/10.1145/1863597.1863601openalex-snapshot
Hereditary substitutions for simple types, formalized
inferredcites →https://doi.org/10.1145/258948.258961openalex-snapshot
Foundations for the implementation of higher-order subtyping
inferredcites →https://doi.org/10.1145/2603088.2603128openalex-snapshot
System F with coercion constraints
inferredcites →https://doi.org/10.1145/2660193.2660216openalex-snapshot
Foundations of path-dependent types
inferredcites →https://doi.org/10.1145/2714064.2660216openalex-snapshot
Foundations of path-dependent types
inferredcites →https://doi.org/10.1145/2983990.2984008openalex-snapshot
Type soundness for dependent object types (DOT)
inferredcites →https://doi.org/10.1145/2998392.2998400openalex-snapshot
Implementing higher-kinded types in Dotty
inferredcites →https://doi.org/10.1145/3022671.2984008openalex-snapshot
Type soundness for dependent object types (DOT)
inferredcites →https://doi.org/10.1145/3133871openalex-snapshot
Unifying typing and subtyping
inferredcites →https://doi.org/10.1145/325694.325724openalex-snapshot
Deciding type equivalence in a language with singleton kinds
inferredcites →https://doi.org/10.1145/3324989.3325724openalex-snapshot
A Multivariate Approach to Ensure Statistical Reproducibility of Climate Model Simulations
inferredcites →https://doi.org/10.1145/3337932.3338813openalex-snapshot
Towards improved GADT reasoning in Scala
inferredcites →https://doi.org/10.1145/3360571openalex-snapshot
A path to DOT: formalizing fully path-dependent types
inferredcites →https://doi.org/10.1145/3371077openalex-snapshot
Undecidability of d <: and its decidable fragments
inferredcites →https://doi.org/10.1145/3408996openalex-snapshot
Scala step-by-step: soundness for DOT with step-indexed logical relations in Iris
inferredcites →https://doi.org/10.1145/6041.6042openalex-snapshot
On understanding types, data abstraction, and polymorphism
inferredcites →https://doi.org/10.1145/73560.73566openalex-snapshot
Structural subtyping and the notion of power type
inferredcites →https://doi.org/10.4230/lipics.tlca.2015.138openalex-snapshot
Undecidability of Equality in the Free Locally Cartesian Closed Category
inferredcites →https://doi.org/10.5075/epfl-thesis-7156openalex-snapshot
Dependent Object Types
inferredcites →https://doi.org/10.5075/epfl-thesis-8014openalex-snapshot
Higher-Order Subtyping with Type Intervals
inferredcites →https://doi.org/10.5281/zenodo.4775731openalex-snapshot
A Theory of Higher-Order Subtyping with Type Intervals — Agda Formalization

What points at this work

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

inferred← backgroundhttps://doi.org/10.5281/zenodo.5060213zenodo-depositor-declared
inferred← citeshttps://doi.org/10.1145/3486610.3486894openalex-snapshot
Pathless Scala: a calculus for the rest of Scala
inferred← citeshttps://doi.org/10.1145/3607862openalex-snapshot
A Graded Modal Dependent Type Theory with a Universe and Erasure, Formalized
inferred← citeshttps://doi.org/10.21105/joss.09241openalex-snapshot
The Agda standard library: version 2.0
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.