On the public citation graph
Types with intersection: An introduction
0 signed · 56 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/malq.19810270205openalex-snapshot
Functional Characters of Solvable Terms
inferredcites →https://doi.org/10.1006/inco.1994.1016openalex-snapshot
Singleton, Union, and Intersection Types for Program Extraction
inferredcites →https://doi.org/10.1007/3-540-08860-1_30openalex-snapshot
Une extension de la theorie des types en λ-calcul
inferredcites →https://doi.org/10.1007/3-540-09510-1_11openalex-snapshot
Functional characterization of some semantic equalities inside λ-calculus
inferredcites →https://doi.org/10.1007/3-540-11494-7_15openalex-snapshot
The simple semantics for Coppo-Dezani-Sallé types
inferredcites →https://doi.org/10.1007/3-540-13346-1_14openalex-snapshot
F-semantics for intersection type discipline
inferredcites →https://doi.org/10.1007/3-540-54345-7_49openalex-snapshot
Strong conjunction and intersection types
inferredcites →https://doi.org/10.1007/3-540-54415-1_69openalex-snapshot
Intersection and union types
inferredcites →https://doi.org/10.1007/3-540-54415-1_70openalex-snapshot
The coherence of languages with intersection types
inferredcites →https://doi.org/10.1007/3-540-54415-1_71openalex-snapshot
Singleton, union and intersection types for program extraction
inferredcites →https://doi.org/10.1007/bfb0022505openalex-snapshot
An extended polymorphic type system for applicative languages
inferredcites →https://doi.org/10.1007/bfb0035793openalex-snapshot
Syntactic control of interference Part 2
inferredcites →https://doi.org/10.1016/0304-3975(83)90069-5openalex-snapshot
Principal type schemes for an extended type theory
inferredcites →https://doi.org/10.1016/0304-3975(86)90043-5openalex-snapshot
A characterization of F-complete type assignments
inferredcites →https://doi.org/10.1016/0304-3975(92)90297-sopenalex-snapshot
Complete restrictions of the intersection type discipline
inferredcites →https://doi.org/10.1016/0304-3975(92)90306-zopenalex-snapshot
Intersection types for combinatory logic
inferredcites →https://doi.org/10.1016/0890-5401(87)90042-3openalex-snapshot
Type theories, normal forms, and D∞-lambda-models
inferredcites →https://doi.org/10.1016/s0019-9958(82)80022-3openalex-snapshot
Characterization theorems for a filter lambda model
inferredcites →https://doi.org/10.1016/s0049-237x(08)71819-6openalex-snapshot
Extended Type Structures and Filter Lambda Models
inferredcites →https://doi.org/10.1111/j.1746-8361.1969.tb01183.xopenalex-snapshot
Modified Basic Functionality in Combinatory Logic
inferredcites →https://doi.org/10.1142/s0129054190000138openalex-snapshot
COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS
inferredcites →https://doi.org/10.1184/r1/6608582openalex-snapshot
Preliminary design of the programming language Forsythe
inferredcites →https://doi.org/10.1184/r1/6608684openalex-snapshot
Programming with intersection types, union types, and polymorphism
inferredcites →https://doi.org/10.1305/ndjfl/1093635158openalex-snapshot
The completeness of provable realizability.
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/2266170openalex-snapshot
A formulation of the simple theory of types
inferredcites →https://doi.org/10.2307/2273659openalex-snapshot
A filter lambda model and the completeness of type assignment
inferredcites →https://doi.org/10.2307/2274588openalex-snapshot
J. Roger Hindley and Jonathan P. Seldin. Introduction to combinators and λ-calculus. London Mathematical Society student texts, no. 1. Cambridge University Press, Cambridge etc. 1986, vi + 360 pp.
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.1007/3-540-44904-3_5openalex-snapshot
On Strong Normalization in the Intersection Type Discipline
inferred← citeshttps://doi.org/10.1007/978-1-4612-4118-8_9openalex-snapshot
Design of the Programming Language Forsythe
inferred← citeshttps://doi.org/10.1007/978-3-642-29485-3_13openalex-snapshot
Overloading Is NP-Complete
inferred← citeshttps://doi.org/10.1007/bfb0037098openalex-snapshot
Combining first and higher order rewrite systems with type assignment systems
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90306-zopenalex-snapshot
Intersection types for combinatory logic
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.045openalex-snapshot
On strong normalization and type inference in the intersection type discipline
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00263-0openalex-snapshot
Intersection type assignment systems with higher-order algebraic rewriting
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00083-3openalex-snapshot
Generalized filter models
inferred← citeshttps://doi.org/10.1017/s095679680100394xopenalex-snapshot
From Polyvariant flow information to intersection and union types
inferred← citeshttps://doi.org/10.1017/s0956796813000270openalex-snapshot
Elaborating intersection and union types
inferred← citeshttps://doi.org/10.1017/s095679689700289xopenalex-snapshot
Modularity of strong normalization in the algebraic-λ-cube
inferred← citeshttps://doi.org/10.1145/2364527.2364534openalex-snapshot
Elaborating intersection and union types
inferred← citeshttps://doi.org/10.1145/2398856.2364534openalex-snapshot
Elaborating intersection and union types
inferred← citeshttps://doi.org/10.1145/268946.268963openalex-snapshot
From polyvariant flow information to intersection and union types
inferred← citeshttps://doi.org/10.1145/2784731.2784744openalex-snapshot
Elaborating evaluation-order polymorphism
inferred← citeshttps://doi.org/10.1145/2858949.2784744openalex-snapshot
Elaborating evaluation-order polymorphism
inferred← citeshttps://doi.org/10.2178/jsl/1190150049openalex-snapshot
A classification of intersection type systems
inferred← citeshttps://doi.org/10.25560/9800openalex-snapshot
Type Systems for Coordination Languages
inferred← citeshttps://doi.org/10.26686/ajl.v1i0.1762openalex-snapshot
Intersection Type Systems and Logics Related to the Meyer–Routley System B+
inferred← citeshttps://doi.org/10.2969/msjmemoirs/00201c020openalex-snapshot
Intersection Types, $\lambda$-models, and Böhm Trees
inferred← citeshttps://doi.org/10.5287/ora-o8oygp8pnopenalex-snapshot
Intersection types and higer-order model checking
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.