On the public citation graph
A guide to polymorphic types
0 signed · 64 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.1006/inco.1993.1037openalex-snapshot
On Functors Expressible in the Polymorphic Typed Lambda Calculus
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-13346-1_13openalex-snapshot
Type inference and type containment
inferredcites →https://doi.org/10.1007/3-540-13346-1_7openalex-snapshot
Polymorphism is not set-theoretic
inferredcites →https://doi.org/10.1007/3-540-15648-8_18openalex-snapshot
Second-order logical relations
inferredcites →https://doi.org/10.1007/3-540-15975-4_26openalex-snapshot
Miranda: A non-strict functional language with polymorphic types
inferredcites →https://doi.org/10.1007/3-540-15983-5_13openalex-snapshot
Constructions: A higher order proof system for mechanizing mathematics
inferredcites →https://doi.org/10.1007/3-540-17184-3openalex-snapshot
Combinators and Functional Programming Languages
inferredcites →https://doi.org/10.1007/3-540-18508-9_18openalex-snapshot
Polymorphism is set theoretic, constructively
inferredcites →https://doi.org/10.1007/3-540-19020-1_18openalex-snapshot
dI-domains as a model of polymorphism
inferredcites →https://doi.org/10.1007/3-540-19020-1_2openalex-snapshot
A categorical approach to realizability and polymorphic types
inferredcites →https://doi.org/10.1007/978-1-4612-0317-9openalex-snapshot
Categorical Combinators, Sequential Algorithms, and Functional Programming
inferredcites →https://doi.org/10.1007/978-3-642-87374-4_12openalex-snapshot
Deduction and Computation
inferredcites →https://doi.org/10.1007/978-3-662-40145-3_2openalex-snapshot
Deduction and Computation
inferredcites →https://doi.org/10.1007/978-94-010-2913-1openalex-snapshot
Combinators, λ-Terms and Proof Theory
inferredcites →https://doi.org/10.1007/bfb0012801openalex-snapshot
Domains for denotational semantics
inferredcites →https://doi.org/10.1007/bfb0014987openalex-snapshot
Extensional models for polymorphism
inferredcites →https://doi.org/10.1007/bfb0064875openalex-snapshot
A realizability interpretation of the theory of species
inferredcites →https://doi.org/10.1016/0168-0072(88)90018-8openalex-snapshot
A small complete category
inferredcites →https://doi.org/10.1016/0304-3975(86)90044-7openalex-snapshot
The system F of variable types, fifteen years later
inferredcites →https://doi.org/10.1016/0304-3975(88)90097-7openalex-snapshot
Extensional models for polymorphism
inferredcites →https://doi.org/10.1016/0890-5401(89)90068-0openalex-snapshot
Domain theoretic models of polymorphism
inferredcites →https://doi.org/10.1016/0890-5401(90)90044-iopenalex-snapshot
The semantics of second-order lambda calculus
inferredcites →https://doi.org/10.1016/0890-5401(90)90062-mopenalex-snapshot
A modest model of records, inheritance, and bounded quantification
inferredcites →https://doi.org/10.1016/1385-7258(72)90034-0openalex-snapshot
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/s0049-237x(09)70551-8openalex-snapshot
Concepts Mathématiques et Informatiques Formalisés dans le Calcul des Constructions
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.5126openalex-snapshot
Semantic parametricity in polymorphic lambda calculus
inferredcites →https://doi.org/10.1109/sfcs.1977.9openalex-snapshot
Conflunt reductions: Abstract properties and applications to term rewriting systems
inferredcites →https://doi.org/10.1109/sfcs.1981.24openalex-snapshot
Number theoretic functions computable by polymorphic programs
inferredcites →https://doi.org/10.1109/sfcs.1983.50openalex-snapshot
Reasoning about functional programs and complexity classes associated with type disciplines
inferredcites →https://doi.org/10.1112/plms/s3-60.1.1openalex-snapshot
The Discrete Objects in the Effective Topos
inferredcites →https://doi.org/10.1137/0211062openalex-snapshot
The Category-Theoretic Solution of Recursive Domain Equations
inferredcites →https://doi.org/10.1145/318593.318606openalex-snapshot
Abstract types have existential types
inferredcites →https://doi.org/10.1145/319838.319872openalex-snapshot
A type-inference approach to reduction properties and semantics of polymorphic expressions (summary)
inferredcites →https://doi.org/10.1145/41625.41646openalex-snapshot
Computable values can be classical
inferredcites →https://doi.org/10.1145/44501.45065openalex-snapshot
Abstract types have existential type
inferredcites →https://doi.org/10.2307/2273831openalex-snapshot
Categorical semantics for higher order polymorphic lambda calculus
inferredcites →https://doi.org/10.2307/2274784openalex-snapshot
Introduction to Higher Order Categorical Logic.
inferredcites →https://doi.org/10.2307/2274839openalex-snapshot
Jean-Yves Girard. Proof theory and logical complexity. Volume I. Studies in proof theory, no. 1. Bibliopolis, Naples 1987, also distributed by Humanities Press, Atlantic Highlands, N.J., 503 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.1013openalex-snapshot
An Extension of System F with Subtyping
inferred← citeshttps://doi.org/10.1007/3-540-47910-4_9openalex-snapshot
Attaching Second-Order Types to Methods in an Object-Oriented Language
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_73openalex-snapshot
An extension of system F with subtyping
inferred← citeshttps://doi.org/10.1007/3-540-60579-7_2openalex-snapshot
A short and flexible proof of strong normalization for the calculus of constructions
inferred← citeshttps://doi.org/10.1007/3540543961_15openalex-snapshot
Outline of a proof theory of parametricity
inferred← citeshttps://doi.org/10.15173/russell.v31i1.2207openalex-snapshot
Generality of Logical Types
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.