On the public citation graph

Let Generalization, Polymorphic Recursion, and Variable Minimization in Boolean-Kinded Type Systems

0 signed · 68 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.1999.2830openalex-snapshot
Semi-Explicit First-Class Polymorphism for ML
inferredcites →https://doi.org/10.1006/jsco.1996.0009openalex-snapshot
Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures
inferredcites →https://doi.org/10.1007/11527695_5openalex-snapshot
Resolve and Expand
inferredcites →https://doi.org/10.1007/3-540-12925-1_41openalex-snapshot
Polymorphic type schemes and recursive definitions
inferredcites →https://doi.org/10.1007/3-540-45470-5_26openalex-snapshot
Unification with Sequence Variables and Flexible Arity Symbols and Its Extension with Pattern-Terms
inferredcites →https://doi.org/10.1007/3-540-52885-7_118openalex-snapshot
Unification in monoidal theories
inferredcites →https://doi.org/10.1007/3-540-56730-5_29openalex-snapshot
General A- and AX-unification via optimized combination procedures
inferredcites →https://doi.org/10.1007/3-540-57880-3_23openalex-snapshot
Dimension types
inferredcites →https://doi.org/10.1007/978-1-4020-9595-5openalex-snapshot
Logic Functions and Equations: Examples and Exercises
inferredcites →https://doi.org/10.1007/978-3-031-10769-6_31openalex-snapshot
Equational Unification and Matching, and Symbolic Reachability Analysis in Maude 3.2 (System Description)
inferredcites →https://doi.org/10.1007/978-3-031-37703-7_2openalex-snapshot
Decision Procedures for Sequence Theories
inferredcites →https://doi.org/10.1007/978-3-319-06686-8_1openalex-snapshot
Finding All Solutions of Equations in Free Groups and Monoids with Involution
inferredcites →https://doi.org/10.1007/978-3-319-96142-2_17openalex-snapshot
Understanding and Extending Incremental Determinization for 2QBF
inferredcites →https://doi.org/10.1007/978-3-642-17685-2_8openalex-snapshot
Types for Units-of-Measure: Theory and Practice
inferredcites →https://doi.org/10.1007/978-3-662-58771-3_1openalex-snapshot
Unification in Modal Logic
inferredcites →https://doi.org/10.1007/bf01018828openalex-snapshot
Simple imperative polymorphism
inferredcites →https://doi.org/10.1007/bf01195536openalex-snapshot
Combination problems for commutative/monoidal theories or how algebra can help in equational unification
inferredcites →https://doi.org/10.1007/bfb0014546openalex-snapshot
Extending ML with semi-explicit higher-order polymorphism
inferredcites →https://doi.org/10.1016/0020-0190(94)00127-8openalex-snapshot
Semi-unification of two terms in Abelian groups
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/0890-5401(91)90050-copenalex-snapshot
Type inference for record concatenation and multiple inheritance
inferredcites →https://doi.org/10.1016/b978-044450813-3/50010-2openalex-snapshot
Unification Theory
inferredcites →https://doi.org/10.1016/j.ic.2005.05.009openalex-snapshot
A new combination procedure for the word problem that generalizes fusion decidability results in modal logics
inferredcites →https://doi.org/10.1016/j.jcss.2021.08.001openalex-snapshot
Word equations in non-deterministic linear space
inferredcites →https://doi.org/10.1016/j.jsc.2014.08.002openalex-snapshot
Regular expression order-sorted unification and matching
inferredcites →https://doi.org/10.1016/s0020-0190(98)00106-9openalex-snapshot
On the complexity of Boolean unification
inferredcites →https://doi.org/10.1016/s0747-7171(08)80089-2openalex-snapshot
Discriminator varieties and symbolic computation
inferredcites →https://doi.org/10.1016/s0747-7171(87)80065-2openalex-snapshot
Embedding boolean expressions into logic programming
inferredcites →https://doi.org/10.1016/s0747-7171(89)80013-6openalex-snapshot
Boolean unification — The story so far
inferredcites →https://doi.org/10.1016/s0747-7171(89)80022-7openalex-snapshot
Unification in a combination of arbitrary disjoint equational theories
inferredcites →https://doi.org/10.1016/s0747-7171(89)80054-9openalex-snapshot
Unification in Boolean Rings and Abelian Groups
inferredcites →https://doi.org/10.1017/cbo9781139172752openalex-snapshot
Term Rewriting and All That
inferredcites →https://doi.org/10.1017/s0956796800001817openalex-snapshot
Type classes with existential types
inferredcites →https://doi.org/10.1093/jigpal/jzq008openalex-snapshot
Unification in modal and description logics
inferredcites →https://doi.org/10.1093/oso/9780198536901.001.0001openalex-snapshot
Arithmetic, proof theory, and computational complexity
inferredcites →https://doi.org/10.1145/100216.100279openalex-snapshot
The undecidability of the semi-unification problem
inferredcites →https://doi.org/10.1145/1159803.1159811openalex-snapshot
Simple unification-based type inference for GADTs
inferredcites →https://doi.org/10.1145/155090.155113openalex-snapshot
The essence of compiling with continuations
inferredcites →https://doi.org/10.1145/169701.169692openalex-snapshot
Type inference with polymorphic recursion
inferredcites →https://doi.org/10.1145/186025.186031openalex-snapshot
Polymorphic type inference and abstract data types
inferredcites →https://doi.org/10.1145/1863597.1863608openalex-snapshot
Type inference in context
inferredcites →https://doi.org/10.1145/224164.224197openalex-snapshot
Dimension inference under polymorphic recursion
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/322234.322243openalex-snapshot
Alternation
inferredcites →https://doi.org/10.1145/3290322openalex-snapshot
Sound and complete bidirectional typechecking for higher-rank polymorphism with existentials and indexed types
inferredcites →https://doi.org/10.1145/3290325openalex-snapshot
Abstracting extensible data types: or, rows by any other name
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/3428222openalex-snapshot
Polymorphic types and effects with Boolean unification
inferredcites →https://doi.org/10.1145/3485487openalex-snapshot
Relational nullable types with Boolean unification
inferredcites →https://doi.org/10.1145/3563304openalex-snapshot
MLstruct: principal type inference in a Boolean algebra of structural types
inferredcites →https://doi.org/10.1145/3607843openalex-snapshot
Generic Programming with Extensible Data Types: Or, Making Ad Hoc Extensible Data Types Less Ad Hoc
inferredcites →https://doi.org/10.1145/3607846openalex-snapshot
With or Without You: Programming with Effect Exclusion
inferredcites →https://doi.org/10.1145/3622816openalex-snapshot
Fast and Efficient Boolean Unification for Hindley-Milner-Style Type and Effect Systems
inferredcites →https://doi.org/10.1145/3632890openalex-snapshot
When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism
inferredcites →https://doi.org/10.1145/3656393openalex-snapshot
Associated Effects: Flexible Abstractions for Effectful Programming
inferredcites →https://doi.org/10.1145/96559.96569openalex-snapshot
Unification in primal algebras, their powers and their varieties
inferredcites →https://doi.org/10.17760/d20467250openalex-snapshot
A foundation for typed concatenative languages
inferredcites →https://doi.org/10.2307/2275480openalex-snapshot
Decidable discriminator varieties from unary varieties
inferredcites →https://doi.org/10.2307/2586506openalex-snapshot
Unification in intuitionistic logic
inferredcites →https://doi.org/10.4204/eptcs.153.8openalex-snapshot
Koka: Programming with Row Polymorphic Effect Types
inferredcites →https://doi.org/10.4230/lipics.ecoop.2023.17openalex-snapshot
Restrictable Variants: A Simple and Practical Alternative to Extensible Variants
inferredcites →https://doi.org/10.4230/lipics.ecoop.2023.18openalex-snapshot
Programming with Purity Reflection: Peaceful Coexistence of Effects, Laziness, and Parallelism
inferredcites →https://doi.org/10.4230/lipics.icalp.2016.127openalex-snapshot
Solutions of word equations over partially commutative structures
inferredcites →https://doi.org/10.4230/lipics.rta.2011.31openalex-snapshot
Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6
inferredcites →https://doi.org/10.48730/jt3g-ws74openalex-snapshot
Type inference, Haskell and dependent types
inferredcites →https://doi.org/10.5281/zenodo.17346847openalex-snapshot
Artifact for: Let Generalization, Polymorphic Recursion, and Variable Minimization in Boolean-Kinded Type Systems

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.17346848zenodo-depositor-declared
inferred← citeshttps://doi.org/10.1145/3828681openalex-snapshot
Mode Crossing
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.