On the public citation graph
An extended polymorphic type system for applicative languages
0 signed · 42 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-06859-7_148openalex-snapshot
Towards a theory of type structure
inferredcites →https://doi.org/10.1016/0022-0000(78)90006-5openalex-snapshot
Tω as a Universal Domain
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(77)90044-5openalex-snapshot
LCF considered as a programming language
inferredcites →https://doi.org/10.1145/359605.359624openalex-snapshot
Some ideas on data types in high-level languages
inferredcites →https://doi.org/10.1145/359763.359800openalex-snapshot
An experimental evaluation of data type conventions
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/2272337openalex-snapshot
An abstract Church-Rosser theorem. II: Applications
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.1995.1141openalex-snapshot
Principal Types and Unification for Simple Intersection Type Systems
inferred← citeshttps://doi.org/10.1007/3-540-13346-1_14openalex-snapshot
F-semantics for intersection type discipline
inferred← citeshttps://doi.org/10.1007/3-540-19027-9_9openalex-snapshot
Parametric overloading in polymorphic programming languages
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_2openalex-snapshot
Abstract Data Types in Computer Algebra
inferred← citeshttps://doi.org/10.1007/3-540-57264-3_46openalex-snapshot
Usage analysis with natural reduction types
inferred← citeshttps://doi.org/10.1007/978-3-031-17715-6_29openalex-snapshot
Type Inference for Rank-2 Intersection Types Using Set Unification
inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_10openalex-snapshot
On Polymorphic Recursion, Type Systems, and Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_17openalex-snapshot
Intersection, Universally Quantified, and Reference Types
inferred← citeshttps://doi.org/10.1007/bf01211394openalex-snapshot
Types with intersection: An introduction
inferred← citeshttps://doi.org/10.1007/bf01807698openalex-snapshot
Conjunction-type standard ML polymorphism
inferred← citeshttps://doi.org/10.1007/bfb0015737openalex-snapshot
A completeness theorem for recursively defined types
inferred← citeshttps://doi.org/10.1016/0167-6423(87)90019-0openalex-snapshot
Basic polymorphic typechecking
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90043-5openalex-snapshot
A characterization of F-complete type assignments
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90109-xopenalex-snapshot
Typing and computational properties of lambda expressions
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.06.017openalex-snapshot
Type Preorders and Recursive Terms
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.018openalex-snapshot
Calculi, types and applications
inferred← citeshttps://doi.org/10.1109/icci.1993.315410openalex-snapshot
λ-calculi with decidable ∩-type checking
inferred← citeshttps://doi.org/10.1109/secon.1990.117797openalex-snapshot
Conjunctive polymorphic type checking on a language of combinators
inferred← citeshttps://doi.org/10.1145/322609.322821openalex-snapshot
Conjunctional type assignment in programming languages
inferred← citeshttps://doi.org/10.1145/582153.582176openalex-snapshot
Principal type-schemes for functional programs
inferred← citeshttps://doi.org/10.1145/75277.75284openalex-snapshot
Type checking records and variants in a natural extension of ML
inferred← citeshttps://doi.org/10.1145/778559.778560openalex-snapshot
Rank 2 intersection types for local definitions and conditional expressions
inferred← citeshttps://doi.org/10.1145/800068.802156openalex-snapshot
A semantic model of types for applicative languages
inferred← citeshttps://doi.org/10.1145/888251.888259openalex-snapshot
Rank 2 intersection types for modules
inferred← citeshttps://doi.org/10.1184/r1/6611171openalex-snapshot
Type checking and type deduction techniques for polymorphic programming languages
inferred← citeshttps://doi.org/10.25959/23242532openalex-snapshot
Reduction types and intensionality in the lambda-calculus
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.