On the public citation graph

Type inference problems: A survey

0 signed · 65 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/3-540-06859-7_148openalex-snapshot

Towards a theory of type structure

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-13346-1_15openalex-snapshot

The typechecking of programs with implicit type structure

inferredcites →https://doi.org/10.1007/3-540-50241-6_36openalex-snapshot

On type inference for object-oriented programming languages

inferredcites →https://doi.org/10.1007/3-540-50517-2_95openalex-snapshot

Semi-unification

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/0743-1066(84)90022-0openalex-snapshot

On the sequential nature of unification

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(92)90020-gopenalex-snapshot

Type reconstruction in finite rank fragments of the second-order λ-calculus

inferredcites →https://doi.org/10.1016/s0049-237x(08)70843-7openalex-snapshot

Une Extension De ĽInterpretation De Gödel a ĽAnalyse, Et Son Application a ĽElimination Des Coupures Dans ĽAnalyse Et La Theorie Des Types

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.1090/tranopenalex-snapshot

Transactions of the American Mathematical Society

inferredcites →https://doi.org/10.1109/lics.1988.5101openalex-snapshot

Characterization of typings in polymorphic type discipline

inferredcites →https://doi.org/10.1109/lics.1988.5111openalex-snapshot

Corrigendum: complete type interference for simple objects

inferredcites →https://doi.org/10.1109/lics.1989.39157openalex-snapshot

Stratified polymorphism

inferredcites →https://doi.org/10.1109/lics.1989.39162openalex-snapshot

Type inference for record concatenation and multiple inheritance

inferredcites →https://doi.org/10.1109/lics.1989.39163openalex-snapshot

Computational consequences and partial solutions of a generalized unification problem

inferredcites →https://doi.org/10.1109/sfcs.1985.44openalex-snapshot

Partial polymorphic type inference is undecidable

inferredcites →https://doi.org/10.1145/100216.100279openalex-snapshot

The undecidability of the semi-unification problem

inferredcites →https://doi.org/10.1145/322358.322370openalex-snapshot

The Expressiveness of Simple and Second-Order Type Structures

inferredcites →https://doi.org/10.1145/567067.567077openalex-snapshot

Polymorphic type inference

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.1145/62678.62700openalex-snapshot

Type inference in a database programming language

inferredcites →https://doi.org/10.1145/62678.62701openalex-snapshot

Type inference and semi-unification

inferredcites →https://doi.org/10.1145/62678.62702openalex-snapshot

ML with extended pattern matching and subtypes

inferredcites →https://doi.org/10.1145/73560.73563openalex-snapshot

The essence of ML

inferredcites →https://doi.org/10.1145/73560.73565openalex-snapshot

A proper extension of ML with an effective type-assignment

inferredcites →https://doi.org/10.1145/73560.73568openalex-snapshot

Type inference with subtypes

inferredcites →https://doi.org/10.1145/75277.75284openalex-snapshot

Type checking records and variants in a natural extension of ML

inferredcites →https://doi.org/10.1145/75277.75286openalex-snapshot

Polymorphic unification and ML typing

inferredcites →https://doi.org/10.1145/800017.800529openalex-snapshot

Coercion and type inference

inferredcites →https://doi.org/10.1145/96709.96748openalex-snapshot

Deciding ML typability is complete for deterministic exponential time

inferredcites →https://doi.org/10.1145/99370.99394openalex-snapshot

On the complexity of type inference with coercion

inferredcites →https://doi.org/10.2307/1995158openalex-snapshot

The Principal Type-Scheme of an Object in Combinatory Logic

inferredcites →https://doi.org/10.2307/2266170openalex-snapshot

A formulation of the simple theory of types

inferredcites →https://doi.org/10.2307/2269811openalex-snapshot

The undecidability of the Turing machine immortality problem

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.1994.1018openalex-snapshot

A Semantics for Static Type Inference

inferred← citeshttps://doi.org/10.1006/inco.1995.1040openalex-snapshot

Embedding a Second-Order Type System into an Intersection Type System

inferred← citeshttps://doi.org/10.1006/jcss.2001.1812openalex-snapshot

Polymorphic Type Inference for the Relational Algebra

inferred← citeshttps://doi.org/10.1007/3-540-44929-9_35openalex-snapshot

Partially Typed Terms between Church-Style and Curry-Style

inferred← citeshttps://doi.org/10.1007/3-540-54415-1_38openalex-snapshot

A semantics for type checking

inferred← citeshttps://doi.org/10.1007/bfb0020784openalex-snapshot

Executable higher-order algebraic specifications

inferred← citeshttps://doi.org/10.1007/bfb0023888openalex-snapshot

Incremental polymorphic type checking with update

inferred← citeshttps://doi.org/10.1007/bfb0056629openalex-snapshot

Constructive negation using typed existence properties

inferred← citeshttps://doi.org/10.1016/0890-5401(92)90020-gopenalex-snapshot

Type reconstruction in finite rank fragments of the second-order λ-calculus

inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.062openalex-snapshot

Checking Emptiness of Non-Deterministic Regular Types with Set Operators

inferred← citeshttps://doi.org/10.1016/j.tcs.2014.05.019openalex-snapshot

Existential type systems between Church and Curry style (type-free style)

inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00161-2openalex-snapshot

Abstract data type systems

inferred← citeshttps://doi.org/10.1016/s0743-1066(97)10010-3openalex-snapshot

Polymorphic type analysis in logic programs by abstract interpretation

inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70018-4openalex-snapshot

Lambda-Calculus and Combinators in the 20th Century

inferred← citeshttps://doi.org/10.1051/ita:2000102openalex-snapshot

Domain-Freeλµ-Calculus

inferred← citeshttps://doi.org/10.1093/logcom/exm001openalex-snapshot

M. H. Newman's Typability Algorithm for Lambda-calculus

inferred← citeshttps://doi.org/10.1109/lics.1991.151659openalex-snapshot

A computation model for executable higher-order algebraic specification languages

inferred← citeshttps://doi.org/10.1109/srii.2012.43openalex-snapshot

On the Connections between Types and Service Level Agreements and Implications for Digital Commercial Printing and Other Domains

inferred← citeshttps://doi.org/10.1109/vl.1994.363643openalex-snapshot

Applicability checking in visual programming languages

inferred← citeshttps://doi.org/10.1145/169701.169687openalex-snapshot

Type reconstruction in the presence of polymorphic recursion

inferred← citeshttps://doi.org/10.1145/182409.182456openalex-snapshot

A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus

inferred← citeshttps://doi.org/10.1145/215465.215597openalex-snapshot

Type analysis of logic programs in the presence of type definitions

inferred← citeshttps://doi.org/10.1145/2259051.2259056openalex-snapshot

Dexpler

inferred← citeshttps://doi.org/10.1145/303976.303984openalex-snapshot

Type inference in the polymorphic relational algebra

inferred← citeshttps://doi.org/10.3929/ethz-a-006527833openalex-snapshot

Intervals: Data-Race-Free Parallel Programming

inferred← citeshttps://doi.org/10.48550/arxiv.cs/0106035openalex-snapshot

Polymorphic type inference for the relational algebra

inferred← citeshttps://doi.org/10.48550/arxiv.cs/9811015openalex-snapshot

An Emptiness Algorithm for Regular Types with Set Operators

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.