On the public citation graph
Extending ML with semi-explicit higher-order polymorphism
0 signed · 35 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.1007/3-540-57887-0_102openalex-snapshot
Programming objects with ML-ART an extension to ML with abstract and record types
inferredcites →https://doi.org/10.1016/0890-5401(88)90009-0openalex-snapshot
Polymorphic type inference and containment
inferredcites →https://doi.org/10.1109/lics.1994.316068openalex-snapshot
Typability and type checking in the second-order λ-calculus are equivalent and undecidable
inferredcites →https://doi.org/10.1145/182409.182456openalex-snapshot
A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus
inferredcites →https://doi.org/10.1145/186025.186031openalex-snapshot
Polymorphic type inference and abstract data types
inferredcites →https://doi.org/10.1145/237721.237729openalex-snapshot
Putting type annotations to work
inferredcites →https://doi.org/10.1145/582153.582176openalex-snapshot
Principal type-schemes for functional programs
inferredcites →https://doi.org/10.1145/62678.62697openalex-snapshot
Partial polymorphic type inference and higher-order unification
inferredcites →https://doi.org/10.3233/fi-1993-191-208openalex-snapshot
On the Undecidability of Partial Polymorphic Type Reconstruction
inferredcites →https://doi.org/10.7551/mitpress/5641.003.0022openalex-snapshot
Pict: A Programming Language Based on the Pi-Calculus
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1096-9942(1998)4:1<27::aid-tapo3>3.0.co;2-4openalex-snapshot
Objective ML: An effective object-oriented extension to ML
inferred← citeshttps://doi.org/10.1006/inco.1999.2830openalex-snapshot
Semi-Explicit First-Class Polymorphism for ML
inferred← citeshttps://doi.org/10.1007/3-540-45699-6_9openalex-snapshot
Using, Understanding, and Unraveling the OCaml Language From Practice to Theory and Vice Versa
inferred← citeshttps://doi.org/10.1007/978-3-540-24754-8_15openalex-snapshot
Relaxing the Value Restriction
inferred← citeshttps://doi.org/10.1007/978-3-642-17164-2_25openalex-snapshot
A Certified Implementation of ML with Structural Polymorphism
inferred← citeshttps://doi.org/10.1016/j.is.2011.01.001openalex-snapshot
Polymorphic queries for P2P systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80691-7openalex-snapshot
Monadic Type Systems: Pure Type Systems for Impure Settings (Preliminary Report)
inferred← citeshttps://doi.org/10.1017/s0960129513000066openalex-snapshot
A certified implementation of ML with structural polymorphism and recursive types
inferred← citeshttps://doi.org/10.1145/1086365.1086383openalex-snapshot
Simple, partial type-inference for System F based on type-containment
inferred← citeshttps://doi.org/10.1145/1090189.1086383openalex-snapshot
Simple, partial type-inference for System F based on type-containment
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/3776644openalex-snapshot
Let Generalization, Polymorphic Recursion, and Variable Minimization in Boolean-Kinded Type Systems
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/944705.944710openalex-snapshot
An extension of HM(X) with bounded existential and universal data-types
inferred← citeshttps://doi.org/10.22028/d291-25722openalex-snapshot
Set based failure diagnosis for concurrent constraint programming
inferred← citeshttps://doi.org/10.4230/lipics.fscd.2021.27openalex-snapshot
What's Decidable about (Atomic) Polymorphism
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.