On the public citation graph

The simple essence of algebraic subtyping: principal type inference with subtyping made easy (functional pearl)

0 signed · 49 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/978-3-319-30936-1_14openalex-snapshot
The Essence of Dependent Object Types
inferredcites →https://doi.org/10.1007/978-3-642-35873-9_21openalex-snapshot
Sound and Complete Flow Typing with Unions, Intersections and Negations
inferredcites →https://doi.org/10.1016/0022-0000(78)90014-4openalex-snapshot
A theory of type polymorphism in programming
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0253905-6openalex-snapshot
The principle type-scheme of an object in combinatory logic
inferredcites →https://doi.org/10.1109/32.713327openalex-snapshot
Subtypes for specifications: predicate subtyping in PVS
inferredcites →https://doi.org/10.1145/1053468.1053470openalex-snapshot
Regular expression types for XML
inferredcites →https://doi.org/10.1145/113445.113468openalex-snapshot
Refinement types for ML
inferredcites →https://doi.org/10.1145/1190215.1190235openalex-snapshot
A very modal model of a modern, major, general type system
inferredcites →https://doi.org/10.1145/1190216.1190235openalex-snapshot
A very modal model of a modern, major, general type system
inferredcites →https://doi.org/10.1145/1375581.1375602openalex-snapshot
Liquid types
inferredcites →https://doi.org/10.1145/1391289.1391293openalex-snapshot
Semantic subtyping
inferredcites →https://doi.org/10.1145/155183.155231openalex-snapshot
Subtyping recursive types
inferredcites →https://doi.org/10.1145/1706299.1706334openalex-snapshot
Pure subtype systems
inferredcites →https://doi.org/10.1145/1932681.1863561openalex-snapshot
Logical types for untyped languages
inferredcites →https://doi.org/10.1145/237721.237729openalex-snapshot
Putting type annotations to work
inferredcites →https://doi.org/10.1145/2544174.2500582openalex-snapshot
Complete and easy bidirectional typechecking for higher-rank polymorphism
inferredcites →https://doi.org/10.1145/2628136.2628161openalex-snapshot
Refinement types for Haskell
inferredcites →https://doi.org/10.1145/2784731.2784738openalex-snapshot
1ML – core and modules united (F-ing first-class modules)
inferredcites →https://doi.org/10.1145/2951913.2951928openalex-snapshot
Set-theoretic types for polymorphic variants
inferredcites →https://doi.org/10.1145/3009837.3009882openalex-snapshot
Polymorphism, subtyping, and type inference in MLsub
inferredcites →https://doi.org/10.1145/3093333.3009882openalex-snapshot
Polymorphism, subtyping, and type inference in MLsub
inferredcites →https://doi.org/10.1145/582153.582176openalex-snapshot
Principal type-schemes for functional programs

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-99336-8_16openalex-snapshot
Polarized Subtyping
inferred← citeshttps://doi.org/10.1007/978-3-031-74776-2_17openalex-snapshot
BinSub: The Simple Essence of Polymorphic Type Inference for Machine Code
inferred← citeshttps://doi.org/10.1007/s11390-025-5978-7openalex-snapshot
An Overview of Cangjie Programming Language
inferred← citeshttps://doi.org/10.1145/3546196.3550163openalex-snapshot
Structural refinement types
inferred← citeshttps://doi.org/10.1145/3563304openalex-snapshot
MLstruct: principal type inference in a Boolean algebra of structural types
inferred← citeshttps://doi.org/10.1145/3622812openalex-snapshot
Getting into the Flow: Towards Better Type Error Messages for Constraint-Based Type Inference
inferred← citeshttps://doi.org/10.1145/3622871openalex-snapshot
Greedy Implicit Bounded Quantification
inferred← citeshttps://doi.org/10.1145/3632890openalex-snapshot
When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism
inferred← citeshttps://doi.org/10.1145/3656393openalex-snapshot
Associated Effects: Flexible Abstractions for Effectful Programming
inferred← citeshttps://doi.org/10.1145/3656401openalex-snapshot
Allo: A Programming Model for Composable Accelerator Design
inferred← citeshttps://doi.org/10.1145/3674634openalex-snapshot
The Long Way to Deforestation: A Type Inference and Elaboration Technique for Removing Intermediate Data Structures
inferred← citeshttps://doi.org/10.1145/3689746openalex-snapshot
The Ultimate Conditional Syntax
inferred← citeshttps://doi.org/10.1145/3694848.3694855openalex-snapshot
The Essence of the Flyweight Design Pattern
inferred← citeshttps://doi.org/10.1145/3704907openalex-snapshot
Bidirectional Higher-Rank Polymorphism with Intersection and Union Types
inferred← citeshttps://doi.org/10.1145/3720472openalex-snapshot
The Simple Essence of Monomorphization
inferred← citeshttps://doi.org/10.1145/3736112.3736141openalex-snapshot
Structuring Arrays with Algebraic Shapes
inferred← citeshttps://doi.org/10.1145/3763096openalex-snapshot
Qualified Types with Boolean Algebras
inferred← citeshttps://doi.org/10.1145/3763144openalex-snapshot
A Lightweight Type-and-Effect System for Invalidation Safety: Tracking Permanent and Temporary Invalidation with Constraint-Based Subtype Inference
inferred← citeshttps://doi.org/10.1145/3763168openalex-snapshot
The Simple Essence of Overloading: Making Ad-Hoc Polymorphism More Algebraic with Flow-Based Variational Type-Checking
inferred← citeshttps://doi.org/10.1145/3763797openalex-snapshot
Type-Outference with Label-Listeners: Foundations for Decidable Type-Consistency for Nominal Object-Oriented Generics
inferred← citeshttps://doi.org/10.1145/3764116openalex-snapshot
Structural Information Flow: A Fresh Look at Types for Non-interference
inferred← citeshttps://doi.org/10.1145/3776644openalex-snapshot
Let Generalization, Polymorphic Recursion, and Variable Minimization in Boolean-Kinded Type Systems
inferred← citeshttps://doi.org/10.1145/3776653openalex-snapshot
Local Contextual Type Inference
inferred← citeshttps://doi.org/10.1145/3776689openalex-snapshot
The Simple Essence of Boolean-Algebraic Subtyping: Semantic Soundness for Algebraic Union, Intersection, Negation, and Equi-recursive Types
inferred← citeshttps://doi.org/10.1145/3798206openalex-snapshot
Diatom: Polylithic Binary Lifting with Data-Flow Summaries and Type-Aware IR Linking
inferred← citeshttps://doi.org/10.1145/3828701openalex-snapshot
First-Class Constrained Types: Elaboration, Type Inference, Approximation, and a Characterization of Termination
inferred← citeshttps://doi.org/10.5311/josis.2023.27.268openalex-snapshot
Procedural metadata for geographic information using an algebra of core concept transformations
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.