On the public citation graph

A note on categorical datatypes

https://doi.org/10.1007/bfb0018348
0 signed · 30 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-13346-1_6openalex-snapshot
The semantics of second order polymorphic lambda calculus
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-15198-2_7openalex-snapshot
Three approaches to type structure
inferredcites →https://doi.org/10.1007/3-540-15648-8_5openalex-snapshot
Recursive definitions in type theory
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-18508-9_24openalex-snapshot
A typed lambda calculus with categorical type constructors
inferredcites →https://doi.org/10.1145/800017.800528openalex-snapshot
An ideal model for recursive polymorphic types
inferredcites →https://doi.org/10.48456/tr-75openalex-snapshot
Design and implementation of a simple typed language based on the lambda-calculus
inferredcites →https://doi.org/10.48550/arxiv.2010.05167openalex-snapshot
A Categorical Programming Language

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-39185-1_1openalex-snapshot
(Co-)Iteration for Higher-Order Nested Datatypes
inferred← citeshttps://doi.org/10.1007/3-540-45788-7openalex-snapshot
Functional and Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_61openalex-snapshot
Parametricity of extensionally collapsed term models of polymorphism and their categorical properties
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_146openalex-snapshot
A unifying type-theoretic framework for objects
inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_13openalex-snapshot
Increasing the Level of Abstraction in Traditional Functional Languages by Using Compile-time Reflection
inferred← citeshttps://doi.org/10.1007/978-3-540-70594-9_8openalex-snapshot
Unfolding Abstract Datatypes
inferred← citeshttps://doi.org/10.1007/bf01212406openalex-snapshot
Categorical ML — Category-theoretic modular programming
inferred← citeshttps://doi.org/10.1007/bf02946501openalex-snapshot
Structures definable in polymorphism
inferred← citeshttps://doi.org/10.1007/bf02948849openalex-snapshot
Semantics of constructions (I) — The traditional approach
inferred← citeshttps://doi.org/10.1007/bfb0037118openalex-snapshot
A logic for parametric polymorphism
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90186-wopenalex-snapshot
Comparing Hagino's categorical programming language and typed lambda-calculi
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00099-5openalex-snapshot
Strong categorical datatypes II: A term logic for categorical programming
inferred← citeshttps://doi.org/10.1016/s1570-7954(00)80027-3openalex-snapshot
Some aspects of categories in computer science
inferred← citeshttps://doi.org/10.1017/s0960129500000372openalex-snapshot
Categorical data types in parametric polymorphism
inferred← citeshttps://doi.org/10.1017/s0960129596002058openalex-snapshot
Categorical properties of logical frameworks
inferred← citeshttps://doi.org/10.1051/ita/2009015openalex-snapshot
Two extensions of system F with (co)iteration and primitive (co)recursion principles
inferred← citeshttps://doi.org/10.1145/2784731.2784759openalex-snapshot
Algebras and coalgebras in the light affine Lambda calculus
inferred← citeshttps://doi.org/10.1145/317636.317789openalex-snapshot
Type fixpoints
inferred← citeshttps://doi.org/10.17863/cam.15863openalex-snapshot
Names and higher-order functions.
inferred← citeshttps://doi.org/10.2168/lmcs-1(2:1)2005openalex-snapshot
General Recursion via Coinductive Types
inferred← citeshttps://doi.org/10.3233/fi-1996-26202openalex-snapshot
RECURSIVE MODELS OF GENERAL INDUCTIVE 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.