On the public citation graph

On the semantic expressiveness of recursive types

https://doi.org/10.1145/3434302
0 signed · 51 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-09724-4openalex-snapshot
Edinburgh LCF
inferredcites →https://doi.org/10.1007/3-540-48749-2_2openalex-snapshot
Protection in Programming-Language Translations
inferredcites →https://doi.org/10.1007/3-540-60246-1_144openalex-snapshot
Positive recursive type assignment
inferredcites →https://doi.org/10.1007/978-3-642-39212-2_28openalex-snapshot
Contractive Signatures with Recursive Types, Type Parameters, and Abstract Types
inferredcites →https://doi.org/10.1016/0167-6423(91)90036-wopenalex-snapshot
On the expressive power of programming languages
inferredcites →https://doi.org/10.1016/0167-6423(93)90004-9openalex-snapshot
On abstraction and the expressive power of programming languages
inferredcites →https://doi.org/10.1016/0304-3975(77)90044-5openalex-snapshot
LCF considered as a programming language
inferredcites →https://doi.org/10.1016/0304-3975(77)90053-6openalex-snapshot
Fully abstract models of typed λ-calculi
inferredcites →https://doi.org/10.1016/j.entcs.2008.04.011openalex-snapshot
Expressiveness of Process Algebras
inferredcites →https://doi.org/10.1016/j.tcs.2006.08.014openalex-snapshot
Securing the .NET programming model
inferredcites →https://doi.org/10.1016/j.tcs.2015.02.027openalex-snapshot
Observational program calculi and the correctness of translations
inferredcites →https://doi.org/10.1016/s0019-9958(86)80019-5openalex-snapshot
An ideal model for recursive polymorphic types
inferredcites →https://doi.org/10.1017/s0960129514000279openalex-snapshot
Full abstraction for expressiveness: history, myths and facts
inferredcites →https://doi.org/10.1109/lics.1996.561324openalex-snapshot
Syntactic considerations on recursive types
inferredcites →https://doi.org/10.1145/1016848.1016878openalex-snapshot
A nanopass infrastructure for compiler education
inferredcites →https://doi.org/10.1145/1411203.1411227openalex-snapshot
Typed closure conversion preserves observational equivalence
inferredcites →https://doi.org/10.1145/1596550.1596567openalex-snapshot
Biorthogonality, step-indexing and compiler correctness
inferredcites →https://doi.org/10.1145/1631687.1596567openalex-snapshot
Biorthogonality, step-indexing and compiler correctness
inferredcites →https://doi.org/10.1145/169701.169696openalex-snapshot
On the type structure of standard ML
inferredcites →https://doi.org/10.1145/1925844.1926402openalex-snapshot
A kripke logical relation between ML and assembly
inferredcites →https://doi.org/10.1145/2034574.2034830openalex-snapshot
An equivalence-preserving CPS translation via multi-language semantics
inferredcites →https://doi.org/10.1145/2034773.2034830openalex-snapshot
An equivalence-preserving CPS translation via multi-language semantics
inferredcites →https://doi.org/10.1145/2429069.2429114openalex-snapshot
Fully abstract compilation to JavaScript
inferredcites →https://doi.org/10.1145/2699503openalex-snapshot
Secure Compilation to Protected Module Architectures
inferredcites →https://doi.org/10.1145/2784731.2784733openalex-snapshot
Noninterference for free
inferredcites →https://doi.org/10.1145/2837614.2837618openalex-snapshot
Fully-abstract compilation by approximate back-translation
inferredcites →https://doi.org/10.1145/2837614.2837660openalex-snapshot
System f-omega with equirecursive types for datatype-generic programming
inferredcites →https://doi.org/10.1145/2914770.2837660openalex-snapshot
System f-omega with equirecursive types for datatype-generic programming
inferredcites →https://doi.org/10.1145/2951913.2951941openalex-snapshot
Fully abstract compilation via universal embedding
inferredcites →https://doi.org/10.1145/3280984openalex-snapshot
Formal Approaches to Secure Compilation
inferredcites →https://doi.org/10.1145/3290332openalex-snapshot
StkTokens: enforcing well-bracketed control flow and stack encapsulation using linear capabilities
inferredcites →https://doi.org/10.1145/3341688openalex-snapshot
Linear capabilities for fully abstract compilation of separation-logic-verified code
inferredcites →https://doi.org/10.1145/504709.504712openalex-snapshot
An indexed model of recursive types for foundational proof-carrying code
inferredcites →https://doi.org/10.1145/800017.800528openalex-snapshot
An ideal model for recursive polymorphic types
inferredcites →https://doi.org/10.23638/lmcs-13(4:2)2017openalex-snapshot
Modular, Fully-abstract Compilation by Approximate Back-translation
inferredcites →https://doi.org/10.48550/arxiv.2001.11334openalex-snapshot
Why Should Anyone use Colours? or, Syntax Highlighting Beyond Code Snippets

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-89051-3_6openalex-snapshot
Fully Abstract and Robust Compilation
inferred← citeshttps://doi.org/10.1007/978-3-030-99336-8_16openalex-snapshot
Polarized Subtyping
inferred← citeshttps://doi.org/10.1007/978-3-031-57231-9openalex-snapshot
Foundations of Software Science and Computation Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-57231-9_3openalex-snapshot
Logical Predicates in Higher-Order Mathematical Operational Semantics
inferred← citeshttps://doi.org/10.1007/978-3-031-91118-7_14openalex-snapshot
Iso-Recursive Multiparty Sessions and their Automated Verification
inferred← citeshttps://doi.org/10.1007/978-3-032-05291-9_18openalex-snapshot
Type Congruence, Duality and Iso-Recursive Binary Session Types
inferred← citeshttps://doi.org/10.1109/csf57540.2023.00019openalex-snapshot
$\pi_{\mathbf{RA}}$: A $\pi\text{-calculus}$ for Verifying Protocols that Use Remote Attestation
inferred← citeshttps://doi.org/10.1145/3527326openalex-snapshot
Purity of an ST monad: full abstraction by semantically typed back-translation
inferred← citeshttps://doi.org/10.1145/3591277openalex-snapshot
Parameterized Algebraic Protocols
inferred← citeshttps://doi.org/10.1145/3661814.3662099openalex-snapshot
Bialgebraic Reasoning on Higher-order Program Equivalence
inferred← citeshttps://doi.org/10.1145/3689718openalex-snapshot
Full Iso-Recursive Types
inferred← citeshttps://doi.org/10.1145/3689747openalex-snapshot
On the Expressive Power of Languages for Static Variability
inferred← citeshttps://doi.org/10.1145/3704869openalex-snapshot
QuickSub: Efficient Iso-Recursive Subtyping
inferred← citeshttps://doi.org/10.46298/lmcs-20(4:14)2024openalex-snapshot
On the Semantic Expressiveness of Iso- and Equi-Recursive Types
inferred← citeshttps://doi.org/10.48550/arxiv.2006.14969openalex-snapshot
Fully Abstract and Robust Compilation and How to Reconcile the Two, Abstractly
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.