On the public citation graph
Subtyping with singleton types
0 signed · 59 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/malq.19800261902openalex-snapshot
Lambda‐Calculus Models and Extensionality
inferredcites →https://doi.org/10.1006/inco.1994.1016openalex-snapshot
Singleton, Union, and Intersection Types for Program Extraction
inferredcites →https://doi.org/10.1007/3-540-58140-5_30openalex-snapshot
Pure Type Systems with definitions
inferredcites →https://doi.org/10.1007/bf01191893openalex-snapshot
Toward formal development of programs from algebraic specifications: Parameterisation revisited
inferredcites →https://doi.org/10.1016/0304-3975(90)90108-topenalex-snapshot
Type checking with universes
inferredcites →https://doi.org/10.1016/0890-5401(88)90007-7openalex-snapshot
A semantics of multiple inheritance
inferredcites →https://doi.org/10.1016/0890-5401(90)90062-mopenalex-snapshot
A modest model of records, inheritance, and bounded quantification
inferredcites →https://doi.org/10.1016/0890-5401(91)90055-7openalex-snapshot
Inheritance as implicit coercion
inferredcites →https://doi.org/10.1017/s0960129500001134openalex-snapshot
Coherence of subsumption, minimum typing and type-checking in F ≤
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/73560.73566openalex-snapshot
Structural subtyping and the notion of power type
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.3128openalex-snapshot
Dependent Types with Subtyping and Late-Bound Overloading
inferred← citeshttps://doi.org/10.1006/inco.2002.2907openalex-snapshot
Intersection and Singleton Type Assignment Characterizing Finite Böhm-Trees
inferred← citeshttps://doi.org/10.1007/3-540-44802-0_30openalex-snapshot
Life without the Terminal Type
inferred← citeshttps://doi.org/10.1007/3-540-44904-3_8openalex-snapshot
A Logical Framework with Dependently Typed Records
inferred← citeshttps://doi.org/10.1007/3-540-45332-6_1openalex-snapshot
Sound and Complete Elimination of Singleton Kinds
inferred← citeshttps://doi.org/10.1007/3-540-45699-6_1openalex-snapshot
An Introduction to Dependent Type Theory
inferred← citeshttps://doi.org/10.1007/978-0-387-35358-6_13openalex-snapshot
Refinement types for specification
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_26openalex-snapshot
Justifying Algorithms for βη-Conversion
inferred← citeshttps://doi.org/10.1007/978-3-540-31987-0_20openalex-snapshot
A Design for a Security-Typed Language with Certificate-Based Declassification
inferred← citeshttps://doi.org/10.1007/978-3-540-40020-2_7openalex-snapshot
Type Checking Parametrised Programs and Specifications in ASL + FPC
inferred← citeshttps://doi.org/10.1007/978-3-642-02273-9_3openalex-snapshot
A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance
inferred← citeshttps://doi.org/10.1007/978-3-642-02444-3_15openalex-snapshot
Manifest Fields and Module Mechanisms in Intensional Type Theory
inferred← citeshttps://doi.org/10.1007/s10207-007-0019-9openalex-snapshot
Dynamic security labels and static information flow control
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.10.019openalex-snapshot
Dynamic Translucency with Abstraction Kinds and Higher-Order Coercions
inferred← citeshttps://doi.org/10.1016/s0168-0072(03)00002-2openalex-snapshot
System ST toward a type system for extraction and proofs of programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00175-4openalex-snapshot
Subtyping dependent types
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80490-0openalex-snapshot
Strong Normalization with Singleton Types
inferred← citeshttps://doi.org/10.1017/s0956796802004604openalex-snapshot
Specification and correctness of lambda lifting
inferred← citeshttps://doi.org/10.1109/lics.2003.1210041openalex-snapshot
System ST β-reduction and completeness
inferred← citeshttps://doi.org/10.1109/secpri.2004.1301323openalex-snapshot
Run-time principals in information-flow type systems
inferred← citeshttps://doi.org/10.1145/1166109.1166112openalex-snapshot
Extensional equivalence and singleton types
inferred← citeshttps://doi.org/10.1145/1167473.1167475openalex-snapshot
Eliminating distinctions of class
inferred← citeshttps://doi.org/10.1145/1227839.1227840openalex-snapshot
Sound and complete elimination of singleton kinds
inferred← citeshttps://doi.org/10.1145/1290520.1290526openalex-snapshot
Run-time principals in information-flow type systems
inferred← citeshttps://doi.org/10.1145/1449764.1449800openalex-snapshot
Constrained types for object-oriented languages
inferred← citeshttps://doi.org/10.1145/1577824.1577829openalex-snapshot
A syntactic account of singleton types via hereditary substitution
inferred← citeshttps://doi.org/10.1145/1735813.1735819openalex-snapshot
Dependent record types revisited
inferred← citeshttps://doi.org/10.1145/1863543.1863560openalex-snapshot
Semantic subtyping with an SMT solver
inferred← citeshttps://doi.org/10.1145/325694.325724openalex-snapshot
Deciding type equivalence in a language with singleton kinds
inferred← citeshttps://doi.org/10.1145/3474834openalex-snapshot
Logical Relations as Types: Proof-Relevant Parametricity for Program Modules
inferred← citeshttps://doi.org/10.1145/3485485openalex-snapshot
Label dependent lambda calculus and gradual typing
inferred← citeshttps://doi.org/10.1145/3498698openalex-snapshot
Type-level programming with match types
inferred← citeshttps://doi.org/10.1145/3591286openalex-snapshot
Extensible Metatheory Mechanization via Family Polymorphism
inferred← citeshttps://doi.org/10.1145/3649835openalex-snapshot
Cedar: A New Language for Expressive, Fast, Safe, and Analyzable Authorization
inferred← citeshttps://doi.org/10.1145/3750555.3811892openalex-snapshot
Strobilus: Enriching Cedar with Stateful Policies
inferred← citeshttps://doi.org/10.1145/964001.964003openalex-snapshot
Simple relational correctness proofs for static analyses and program transformations
inferred← citeshttps://doi.org/10.21236/ada436474openalex-snapshot
Fully Reflexive Intensional Type Analysis in Type Erasure Semantics
inferred← citeshttps://doi.org/10.2168/lmcs-7(2:4)2011openalex-snapshot
A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance
inferred← citeshttps://doi.org/10.3233/jcs-15791openalex-snapshot
Paragon – Practical programming with information flow control
inferred← citeshttps://doi.org/10.4204/eptcs.394.10openalex-snapshot
Q# as a Quantum Algorithmic Language
inferred← citeshttps://doi.org/10.48550/arxiv.2011.07653openalex-snapshot
Coming to Terms with Your Choices: An Existential Take on Dependent Types
inferred← citeshttps://doi.org/10.5381/jot.2022.21.2.a3openalex-snapshot
Toward a Lingua Franca for Memory Safety.
inferred← citeshttps://doi.org/10.7551/mitpress/1104.001.0001openalex-snapshot
Advanced Topics in Types and Programming Languages
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.