On the public citation graph

Scala step-by-step: soundness for DOT with step-indexed logical relations in Iris

https://doi.org/10.1145/3408996
0 signed · 65 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/11821069_1openalex-snapshot
A Core Calculus for Scala Type Checking
inferredcites →https://doi.org/10.1007/978-3-319-08918-8_16openalex-snapshot
Self Types for Dependently Typed Lambda Encodings
inferredcites →https://doi.org/10.1007/978-3-319-22102-1_24openalex-snapshot
Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions
inferredcites →https://doi.org/10.1007/978-3-319-30936-1_14openalex-snapshot
The Essence of Dependent Object Types
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_26openalex-snapshot
The Essence of Higher-Order Concurrent Separation Logic
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_34openalex-snapshot
A Higher-Order Logic for Concurrent Termination-Preserving Refinement
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/j.tcs.2010.07.010openalex-snapshot
The category-theoretic solution of recursive metric-space equations
inferredcites →https://doi.org/10.1017/s0956796818000151openalex-snapshot
Iris from the ground up: A modular foundation for higher-order concurrent separation logic
inferredcites →https://doi.org/10.1109/lics.2000.855774openalex-snapshot
A modality for recursion
inferredcites →https://doi.org/10.1109/lics.2003.1210048openalex-snapshot
Dependent intersection: a new way of defining records in type theory
inferredcites →https://doi.org/10.1109/sp40001.2021.00003openalex-snapshot
Compositional Non-Interference for Fine-Grained Concurrent Programs
inferredcites →https://doi.org/10.1145/1111037.1111062openalex-snapshot
A virtual class calculus
inferredcites →https://doi.org/10.1145/1190215.1190235openalex-snapshot
A very modal model of a modern, major, general type system
inferredcites →https://doi.org/10.1145/1190216.1190235openalex-snapshot
A very modal model of a modern, major, general type system
inferredcites →https://doi.org/10.1145/1218563.1218578openalex-snapshot
Tribe
inferredcites →https://doi.org/10.1145/169701.169696openalex-snapshot
On the type structure of standard ML
inferredcites →https://doi.org/10.1145/1706299.1706334openalex-snapshot
Pure subtype systems
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/1925844.1926401openalex-snapshot
Step-indexed kripke models over recursive worlds
inferredcites →https://doi.org/10.1145/2676726.2676980openalex-snapshot
Iris
inferredcites →https://doi.org/10.1145/2951913.2951943openalex-snapshot
Higher-order ghost state
inferredcites →https://doi.org/10.1145/2983990.2984008openalex-snapshot
Type soundness for dependent object types (DOT)
inferredcites →https://doi.org/10.1145/2998392.2998400openalex-snapshot
Implementing higher-kinded types in Dotty
inferredcites →https://doi.org/10.1145/3009837.3009855openalex-snapshot
Interactive proofs in higher-order concurrent separation logic
inferredcites →https://doi.org/10.1145/3009837.3009866openalex-snapshot
Type soundness proofs with definitional interpreters
inferredcites →https://doi.org/10.1145/3009837.3009877openalex-snapshot
A relational model of types-and-effects in higher-order concurrent separation logic
inferredcites →https://doi.org/10.1145/3009837.3009892openalex-snapshot
Modules, abstraction, and parametric polymorphism
inferredcites →https://doi.org/10.1145/301618.301641openalex-snapshot
What is a recursive module?
inferredcites →https://doi.org/10.1145/3022671.2984008openalex-snapshot
Type soundness for dependent object types (DOT)
inferredcites →https://doi.org/10.1145/3093333.3009866openalex-snapshot
Type soundness proofs with definitional interpreters
inferredcites →https://doi.org/10.1145/3093333.3009892openalex-snapshot
Modules, abstraction, and parametric polymorphism
inferredcites →https://doi.org/10.1145/3133870openalex-snapshot
A simple soundness proof for dependent object types
inferredcites →https://doi.org/10.1145/3133913openalex-snapshot
Robust and compositional verification of object capability patterns
inferredcites →https://doi.org/10.1145/3136000.3136003openalex-snapshot
Towards algorithmic typing for DOT (short paper)
inferredcites →https://doi.org/10.1145/3158152openalex-snapshot
A logical relation for monadic encapsulation of state: proving contextual equivalences in the presence of runST
inferredcites →https://doi.org/10.1145/3158154openalex-snapshot
RustBelt: securing the foundations of the Rust programming language
inferredcites →https://doi.org/10.1145/3209108.3209174openalex-snapshot
ReLoC
inferredcites →https://doi.org/10.1145/3236772openalex-snapshot
MoSeL: a general, extensible modal framework for interactive proofs in separation logic
inferredcites →https://doi.org/10.1145/3241653.3241659openalex-snapshot
κDOT: scaling DOT with mutation and constructors
inferredcites →https://doi.org/10.1145/3293880.3294101openalex-snapshot
Autosubst 2: reasoning with multi-sorted de Bruijn terms and vector substitutions
inferredcites →https://doi.org/10.1145/3360571openalex-snapshot
A path to DOT: formalizing fully path-dependent types
inferredcites →https://doi.org/10.1145/3418295openalex-snapshot
Safe Systems Programming in Rust: The Promise and the Challenge
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/zenodo.3926703openalex-snapshot
Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization
inferredcites →https://doi.org/10.23638/lmcs-15(1:8)2019openalex-snapshot
A Light Modality for Recursion
inferredcites →https://doi.org/10.3233/fi-1998-33401openalex-snapshot
Coinductive Axiomatization of Recursive Type Equality and Subtyping
inferredcites →https://doi.org/10.4230/lipics.ecoop.2017.27openalex-snapshot
Towards Strong Normalization for Dependent Object Types (DOT)
inferredcites →https://doi.org/10.5075/epfl-thesis-7156openalex-snapshot
Dependent Object Types

What points at this work

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

inferred← backgroundhttps://doi.org/10.5281/zenodo.3926703zenodo-depositor-declared
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.1145/3437992.3439914openalex-snapshot
Machine-checked semantic session typing
inferred← citeshttps://doi.org/10.1145/3453483.3454031openalex-snapshot
Transfinite Iris: resolving an existential dilemma of step-indexed separation logic
inferred← citeshttps://doi.org/10.1145/3473574openalex-snapshot
A theory of higher-order subtyping with type intervals
inferred← citeshttps://doi.org/10.1145/3486610.3486894openalex-snapshot
Pathless Scala: a calculus for the rest of Scala
inferred← citeshttps://doi.org/10.1145/3498698openalex-snapshot
Type-level programming with match types
inferred← citeshttps://doi.org/10.1145/3547631openalex-snapshot
Later credits: resourceful reasoning for the later modality
inferred← citeshttps://doi.org/10.1145/3563342openalex-snapshot
A case for DOT: theoretical foundations for objects with pattern matching and GADT-style reasoning
inferred← citeshttps://doi.org/10.1145/3661814.3662099openalex-snapshot
Bialgebraic Reasoning on Higher-order Program Equivalence
inferred← citeshttps://doi.org/10.1145/3676954openalex-snapshot
A Logical Approach to Type Soundness
inferred← citeshttps://doi.org/10.1145/3719027.3744801openalex-snapshot
Logical Relations for Formally Verified Authenticated Data Structures
inferred← citeshttps://doi.org/10.1145/3828682openalex-snapshot
Completeness of Iris-Based Program Logics
inferred← citeshttps://doi.org/10.46298/lmcs-17(3:9)2021openalex-snapshot
ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity
inferred← citeshttps://doi.org/10.46298/lmcs-18(2:16)2022openalex-snapshot
Actris 2.0: Asynchronous Session-Type Based Reasoning in Separation Logic
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.