On the public citation graph
A Core Calculus for Scala Type Checking
0 signed · 67 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.1994.1055openalex-snapshot
Bounded Quantification Is Undecidable
inferredcites →https://doi.org/10.1007/10704567_4openalex-snapshot
A Primitive Calculus for Module Systems
inferredcites →https://doi.org/10.1007/3-540-45927-8_2openalex-snapshot
Mixin Modules in a Call-by-Value Setting
inferredcites →https://doi.org/10.1007/978-3-540-24851-4_6openalex-snapshot
The Expression Problem Revisited
inferredcites →https://doi.org/10.1007/978-3-540-45070-2_10openalex-snapshot
A Nominal Theory of Objects with Dependent Types
inferredcites →https://doi.org/10.1007/bfb0054106openalex-snapshot
A statically safe alternative to virtual types
inferredcites →https://doi.org/10.1016/s1571-0661(04)80799-0openalex-snapshot
Some Challenging Typing Issues in Object-Oriented Languages
inferredcites →https://doi.org/10.1017/s0956796800001933openalex-snapshot
A syntactic theory of type generativity and sharing
inferredcites →https://doi.org/10.1017/s0956796801004257openalex-snapshot
A calculus of module systems
inferredcites →https://doi.org/10.1109/iccl.1992.185492openalex-snapshot
Modularity meets inheritance
inferredcites →https://doi.org/10.1145/1028976.1028986openalex-snapshot
Scalable extensibility via nested inheritance
inferredcites →https://doi.org/10.1145/1035292.1028986openalex-snapshot
Scalable extensibility via nested inheritance
inferredcites →https://doi.org/10.1145/1094811.1094815openalex-snapshot
Scalable component abstractions
inferredcites →https://doi.org/10.1145/174675.176927openalex-snapshot
A type-theoretic approach to higher-order modules with sharing
inferredcites →https://doi.org/10.1145/967900.968162openalex-snapshot
Adding wildcards to the Java programming language
inferredcites →https://doi.org/10.5075/epfl-thesis-3509openalex-snapshot
A typed intermediate language and algorithms for compiling scala by successive rewritings
inferredcites →https://doi.org/10.7146/dpb.v29i549.7654openalex-snapshot
gbeta - a Language with Virtual Attributes, Block Structure, and Propagating, Dynamic Inheritance
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-319-08245-5_18openalex-snapshot
Using Path-Dependent Types to Build Type Safe JavaScript Foreign Function Interfaces
inferred← citeshttps://doi.org/10.1007/978-3-319-30936-1_14openalex-snapshot
The Essence of Dependent Object Types
inferred← citeshttps://doi.org/10.1007/978-3-540-73589-2_14openalex-snapshot
Matching Objects with Patterns
inferred← citeshttps://doi.org/10.1007/978-3-642-13953-6_11openalex-snapshot
EriLex: An Embedded Domain Specific Language Generator
inferred← citeshttps://doi.org/10.1007/978-3-642-38197-3_2openalex-snapshot
An Introduction to Search Combinators
inferred← citeshttps://doi.org/10.1007/978-3-662-44202-9_3openalex-snapshot
Constructing Call Graphs of Scala Programs
inferred← citeshttps://doi.org/10.1007/s10990-012-9083-6openalex-snapshot
Path resolution for nested recursive modules
inferred← citeshttps://doi.org/10.1145/1297027.1297037openalex-snapshot
Variant path types for scalable extensibility
inferred← citeshttps://doi.org/10.1145/1297105.1297037openalex-snapshot
Variant path types for scalable extensibility
inferred← citeshttps://doi.org/10.1145/2450136.2450137openalex-snapshot
Mixin’ Up the ML Module System
inferred← citeshttps://doi.org/10.1145/2660193.2660216openalex-snapshot
Foundations of path-dependent types
inferred← citeshttps://doi.org/10.1145/2660193.2660230openalex-snapshot
Finding minimum type error sources
inferred← citeshttps://doi.org/10.1145/2714064.2660216openalex-snapshot
Foundations of path-dependent types
inferred← citeshttps://doi.org/10.1145/2714064.2660230openalex-snapshot
Finding minimum type error sources
inferred← citeshttps://doi.org/10.1145/2814228.2814245openalex-snapshot
Isolates, channels, and event streams for composable distributed programming
inferred← citeshttps://doi.org/10.1145/2824234openalex-snapshot
Type-Based Call Graph Construction Algorithms for Scala
inferred← citeshttps://doi.org/10.1145/2983990.2984008openalex-snapshot
Type soundness for dependent object types (DOT)
inferred← citeshttps://doi.org/10.1145/3009837.3009866openalex-snapshot
Type soundness proofs with definitional interpreters
inferred← citeshttps://doi.org/10.1145/3022671.2984008openalex-snapshot
Type soundness for dependent object types (DOT)
inferred← citeshttps://doi.org/10.1145/3093333.3009866openalex-snapshot
Type soundness proofs with definitional interpreters
inferred← citeshttps://doi.org/10.1145/3133870openalex-snapshot
A simple soundness proof for dependent object types
inferred← citeshttps://doi.org/10.1145/3360571openalex-snapshot
A path to DOT: formalizing fully path-dependent types
inferred← citeshttps://doi.org/10.1145/3408996openalex-snapshot
Scala step-by-step: soundness for DOT with step-indexed logical relations in Iris
inferred← citeshttps://doi.org/10.1145/3486610.3486894openalex-snapshot
Pathless Scala: a calculus for the rest of Scala
inferred← citeshttps://doi.org/10.14232/actacyb.282762openalex-snapshot
Type Inference of Simple Recursive Functions in Scala
inferred← citeshttps://doi.org/10.23638/lmcs-13(4:27)2017openalex-snapshot
Privacy by typing in the $\pi$-calculus
inferred← citeshttps://doi.org/10.26083/tuprints-00002353openalex-snapshot
Advanced Object-Oriented Language Mechanisms for Variability Management
inferred← citeshttps://doi.org/10.26686/wgtn.13174946openalex-snapshot
FHJ: A formal model for hierarchical dispatching and overriding
inferred← citeshttps://doi.org/10.26686/wgtn.13174946.v1openalex-snapshot
FHJ: A formal model for hierarchical dispatching and overriding
inferred← citeshttps://doi.org/10.4230/lipics.ecoop.2016.20openalex-snapshot
Dinaturality Meets Genericity: A Game Semantics of Bounded Polymorphism
inferred← citeshttps://doi.org/10.48550/arxiv.1104.3116openalex-snapshot
Simple, Decidable Type Inference with Subtyping
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.