On the public citation graph
A completeness theorem for recursively defined types
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-06841-4_61openalex-snapshot
Algorithmes d'Equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples
inferredcites →https://doi.org/10.1007/3-540-12727-5_10openalex-snapshot
Completeness results for a polymorphic type system
inferredcites →https://doi.org/10.1007/978-94-009-7893-5_13openalex-snapshot
Fundamental Properties of Infinite Trees
inferredcites →https://doi.org/10.1007/bfb0022505openalex-snapshot
An extended polymorphic type system for applicative languages
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(76)90009-8openalex-snapshot
An algebraic interpretation of the λβK-calculus; and an application of a labelled λ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(83)90059-2openalex-snapshot
Fundamental properties of infinite trees
inferredcites →https://doi.org/10.1016/0304-3975(84)90005-7openalex-snapshot
Completeness of type assignment in continuous lambda models
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1112/jlms/s2-12.3.361openalex-snapshot
A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
inferredcites →https://doi.org/10.1145/582153.582176openalex-snapshot
Principal type-schemes for functional programs
inferredcites →https://doi.org/10.1145/800017.800528openalex-snapshot
An ideal model for recursive polymorphic types
inferredcites →https://doi.org/10.1145/800068.802156openalex-snapshot
A semantic model of types for applicative languages
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-52531-9_128openalex-snapshot
A theory for program and data type specification
inferred← citeshttps://doi.org/10.1007/3-540-53507-1_69openalex-snapshot
Representing object identity in a pure functional language
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_14openalex-snapshot
Domains in a realizability framework
inferred← citeshttps://doi.org/10.1007/3-540-54141-1_7openalex-snapshot
Typing schemes for objects with locality
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_4openalex-snapshot
An algebraic approach to the interpretation of recursive types
inferred← citeshttps://doi.org/10.1007/bfb0017128openalex-snapshot
Functional programming and combinatory algebras
inferred← citeshttps://doi.org/10.1007/bfb0035759openalex-snapshot
Relational semantics for recursive types and bounded quantification
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90034-5openalex-snapshot
Combining type disciplines
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90169-gopenalex-snapshot
A theory for program and data type specification
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90020-3openalex-snapshot
Type inference with recursive types: Syntax and semantics
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90055-7openalex-snapshot
Inheritance as implicit coercion
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90074-copenalex-snapshot
Recursion over realizability structures
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50012-3openalex-snapshot
Functional Programming and Lambda Calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.018openalex-snapshot
Calculi, types and applications
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80019-5openalex-snapshot
An ideal model for recursive polymorphic types
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00298-5openalex-snapshot
A coinductive completeness proof for the equivalence of recursive types
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/1994280605131openalex-snapshot
Toward a semantics for the QUEST language
inferred← citeshttps://doi.org/10.1109/lics.1991.151626openalex-snapshot
Toward a semantics for the QUEST language
inferred← citeshttps://doi.org/10.1145/143165.143230openalex-snapshot
PER models of subtyping, recursive types and higher-order polymorphism
inferred← citeshttps://doi.org/10.1145/263699.263744openalex-snapshot
Types as abstract interpretations
inferred← citeshttps://doi.org/10.1145/3704869openalex-snapshot
QuickSub: Efficient Iso-Recursive Subtyping
inferred← citeshttps://doi.org/10.1145/99370.99393openalex-snapshot
A simple semantics for ML polymorphism
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.