On the public citation graph
MLstruct: principal type inference in a Boolean algebra of structural types
0 signed · 79 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/(sici)1096-9942(199901/03)5:1<35::aid-tapo4>3.0.co;2-4openalex-snapshot
Type inference with constrained types
inferredcites →https://doi.org/10.1006/inco.1995.1086openalex-snapshot
Intersection and Union Types: Syntax and Semantics
inferredcites →https://doi.org/10.1006/inco.2001.2963openalex-snapshot
Simplifying Subtyping Constraints: A Theory
inferredcites →https://doi.org/10.1007/978-1-4612-4118-8_9openalex-snapshot
Design of the Programming Language Forsythe
inferredcites →https://doi.org/10.1007/978-1-4612-4138-6openalex-snapshot
Object-Oriented Programming A Unified Foundation
inferredcites →https://doi.org/10.1007/978-3-540-40018-9_19openalex-snapshot
Type Inference with Structural Subtyping: A Faithful Formalization of an Efficient Constraint Solver
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.1007/bf01212524openalex-snapshot
Type inference with non-structural subtyping
inferredcites →https://doi.org/10.1016/0022-0000(78)90014-4openalex-snapshot
A theory of type polymorphism in programming
inferredcites →https://doi.org/10.1016/0304-3975(90)90144-7openalex-snapshot
Type inference with subtypes
inferredcites →https://doi.org/10.1016/s0019-9958(86)80019-5openalex-snapshot
An ideal model for recursive polymorphic types
inferredcites →https://doi.org/10.1016/s0022-0000(05)80051-0openalex-snapshot
Efficient inference of partial types
inferredcites →https://doi.org/10.1017/s0956796802004318openalex-snapshot
Recursive subtyping revealed
inferredcites →https://doi.org/10.1109/lics.1993.287606openalex-snapshot
Proceedings of 8th Annual IEEE Symposium on Logic in Computer Science
inferredcites →https://doi.org/10.1109/lics.2003.1210073openalex-snapshot
A constraint-based presentation and generalization of rows
inferredcites →https://doi.org/10.1145/1053468.1053470openalex-snapshot
Regular expression types for XML
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/1328438.1328486openalex-snapshot
The design and implementation of typed scheme
inferredcites →https://doi.org/10.1145/165180.165188openalex-snapshot
Type inclusion constraints and type inference
inferredcites →https://doi.org/10.1145/174675.177847openalex-snapshot
Soft typing with conditional types
inferredcites →https://doi.org/10.1145/217838.217858openalex-snapshot
Sound polymorphic type inference for objects
inferredcites →https://doi.org/10.1145/218570.218572openalex-snapshot
A polymorphic record calculus and its compilation
inferredcites →https://doi.org/10.1145/232627.232642openalex-snapshot
Simplifying subtyping constraints
inferredcites →https://doi.org/10.1145/2364527.2364534openalex-snapshot
Elaborating intersection and union types
inferredcites →https://doi.org/10.1145/289423.289448openalex-snapshot
A framework for type inference with subtyping
inferredcites →https://doi.org/10.1145/2951913.2951928openalex-snapshot
Set-theoretic types for polymorphic variants
inferredcites →https://doi.org/10.1145/3093333.3009882openalex-snapshot
Polymorphism, subtyping, and type inference in MLsub
inferredcites →https://doi.org/10.1145/3276482openalex-snapshot
Empowering union and intersection types with integrated subtyping
inferredcites →https://doi.org/10.1145/3409006openalex-snapshot
The simple essence of algebraic subtyping: principal type inference with subtyping made easy (functional pearl)
inferredcites →https://doi.org/10.1145/3473594openalex-snapshot
Distributing intersection and union types with splits and duality (functional pearl)
inferredcites →https://doi.org/10.1145/3498674openalex-snapshot
On type-cases, union elimination, and occurrence typing
inferredcites →https://doi.org/10.1145/351240.351259openalex-snapshot
Intersection types and computational effects
inferredcites →https://doi.org/10.1145/582153.582176openalex-snapshot
Principal type-schemes for functional programs
inferredcites →https://doi.org/10.1305/ndjfl/1040067315openalex-snapshot
Strong Normalization and Typability with Intersection Types
inferredcites →https://doi.org/10.1305/ndjfl/1093883253openalex-snapshot
An extension of the basic functionality theory for the $\lambda$-calculus.
inferredcites →https://doi.org/10.2307/1995158openalex-snapshot
The Principal Type-Scheme of an Object in Combinatory Logic
inferredcites →https://doi.org/10.2307/2273659openalex-snapshot
A filter lambda model and the completeness of type assignment
inferredcites →https://doi.org/10.4230/lipics.ecoop.2020.29openalex-snapshot
The Duality of Subtyping
inferredcites →https://doi.org/10.4230/lipics.ecoop.2022.25openalex-snapshot
Union Types with Disjoint Switches
inferredcites →https://doi.org/10.5281/zenodo.7086365openalex-snapshot
MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types (Artifact)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11390-025-5978-7openalex-snapshot
An Overview of Cangjie Programming Language
inferred← citeshttps://doi.org/10.1109/ase56229.2023.00186openalex-snapshot
Pluggable Type Inference for Free
inferred← citeshttps://doi.org/10.1145/3563768.3563951openalex-snapshot
Simple Extensible Programming through Precisely-Typed Open Recursion
inferred← citeshttps://doi.org/10.1145/3587216.3587220openalex-snapshot
Set-theoretic Types for Erlang
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/3622836openalex-snapshot
Structural Subtyping as Parametric Polymorphism
inferred← citeshttps://doi.org/10.1145/3622871openalex-snapshot
Greedy Implicit Bounded Quantification
inferred← citeshttps://doi.org/10.1145/3632882openalex-snapshot
Polymorphic Type Inference for Dynamic Languages
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/3674634openalex-snapshot
The Long Way to Deforestation: A Type Inference and Elaboration Technique for Removing Intermediate Data Structures
inferred← citeshttps://doi.org/10.1145/3689484.3690733openalex-snapshot
Seamless Scope-Safe Metaprogramming through Polymorphic Subtype Inference (Short Paper)
inferred← citeshttps://doi.org/10.1145/3704869openalex-snapshot
QuickSub: Efficient Iso-Recursive Subtyping
inferred← citeshttps://doi.org/10.1145/3704907openalex-snapshot
Bidirectional Higher-Rank Polymorphism with Intersection and Union Types
inferred← citeshttps://doi.org/10.1145/3720497openalex-snapshot
Polymorphic Records for Dynamic Languages
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/3763797openalex-snapshot
Type-Outference with Label-Listeners: Foundations for Decidable Type-Consistency for Nominal Object-Oriented Generics
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/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/3776724openalex-snapshot
A Complementary Approach to Incorrectness Typing
inferred← citeshttps://doi.org/10.1145/3798220openalex-snapshot
Type Inference for Functional and Imperative Dynamic Languages
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.1145/3828708openalex-snapshot
Set-Theoretic Types for Erlang in Practice (Experience Report)
inferred← citeshttps://doi.org/10.1145/3839500openalex-snapshot
Programming with Composable Recursive Patterns and Transformations
inferred← citeshttps://doi.org/10.1145/3839514openalex-snapshot
Modular Type Safety for Traits with Extensible Variants and Deep Pattern Matching
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.