Cover Image

Positive Sharing and Abstract Machines

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Accattoli, Beniamino, Coen, Claudio Sacerdoti, Wu, Jui-Hsuan
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science Programming Languages
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Positive Focusing is Directly Useful
by: Accattoli, Beniamino, et al.
Published: (2024)

IMELL Cut Elimination with Linear Overhead
by: Accattoli, Beniamino, et al.
Published: (2024)

The Vanilla Sequent Calculus is Call-by-Value (Fresh Perspective)
by: Accattoli, Beniamino
Published: (2024)

Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
by: Accattoli, Beniamino
Published: (2022)

The Cost of Skeletal Call-by-Need, Smoothly
by: Accattoli, Beniamino, et al.
Published: (2025)

Multi types and reasonable space
by: Accattoli, Beniamino, et al.
Published: (2022)

Interaction Equivalence
by: Accattoli, Beniamino, et al.
Published: (2024)

Reasonable Space for the $λ$-Calculus, Logarithmically
by: Accattoli, Beniamino, et al.
Published: (2022)

A Reversible Crumbling Abstract Machine for Plotkin's Call-by-Value
by: Pizzo, Nicolò, et al.
Published: (2026)

Closure Conversion, Flat Environments, and the Complexity of Abstract Machines
by: Accattoli, Beniamino, et al.
Published: (2025)

Mirroring Call-by-Need, or Values Acting Silly
by: Accattoli, Beniamino, et al.
Published: (2024)

Proceedings Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
by: Rabe, Florian, et al.
Published: (2024)

Extended Abstract: Mutable Objects with Several Implementations
by: Kaufmann, Matt, et al.
Published: (2025)

A Program Logic for Abstract (Hyper)Properties
by: Baldan, Paolo, et al.
Published: (2026)

An Abstract Domain for Heap Commutativity (Extended Version)
by: Pincus, Jared, et al.
Published: (2024)

Abstract Operational Methods for Call-by-Push-Value
by: Goncharov, Sergey, et al.
Published: (2024)

Rely-Guarantee Reasoning for Causally Consistent Shared Memory (Extended Version)
by: Lahav, Ori, et al.
Published: (2023)

The Functional Machine Calculus III: Control
by: Heijltjes, Willem
Published: (2025)

Checkpoint-based rollback recovery in session programming
by: Mezzina, Claudio Antares, et al.
Published: (2023)

Context-Sensitive Abstract Interpretation of Dynamic Languages
by: Piszcz, Franciszek
Published: (2024)

revTPL: The Reversible Temporal Process Language
by: Bocchi, Laura, et al.
Published: (2022)

A Coq Library of Sets for Teaching Denotational Semantics
by: Cao, Qinxiang, et al.
Published: (2024)

Kleene algebra with commutativity conditions is undecidable
by: de Amorim, Arthur Azevedo, et al.
Published: (2024)

A Formally Verified Procedure for Width Inference in FIRRTL
by: Wang, Keyin, et al.
Published: (2026)

Foundations of Digital Circuits: Denotation, Operational, and Algebraic Semantics
by: Kaye, George
Published: (2025)

Impredicativity in Linear Dependent Type Theory
by: Speight, Sam, et al.
Published: (2026)

A Probabilistic Choreography Language for PRISM
by: Carbone, Marco, et al.
Published: (2025)

Denotational Semantics for Probabilistic and Concurrent Programs
by: Zilberstein, Noam, et al.
Published: (2025)

Verifying Graph Algorithms in Separation Logic: A Case for an Algebraic Approach (Extended Version)
by: Grandury, Marcos, et al.
Published: (2025)

Expressive Power of One-Shot Control Operators and Coroutines
by: Kobayashi, Kentaro, et al.
Published: (2025)

Separating the Wheat from the Chaff: Understanding (In-)Completeness of Proof Mechanisms for Separation Logic with Inductive Definitions
by: Elad, Neta, et al.
Published: (2025)

Formal Verification of a Token Sale Launchpad: A Compositional Approach in Dafny
by: Ukhanov, Evgeny
Published: (2025)

Orthologic Type Systems
by: Guilloud, Simon, et al.
Published: (2025)

Correct Black-Box Monitors for Distributed Deadlock Detection: Formalisation and Implementation (Technical Report)
by: Rowicki, Radosław Jan, et al.
Published: (2025)

Contextual Refinement of Higher-Order Concurrent Probabilistic Programs (Extended Version)
by: Li, Kwing Hei, et al.
Published: (2025)

Proceedings Twelfth Workshop on Fixed Points in Computer Science
by: Saurin, Alexis
Published: (2025)

A Lazy, Concurrent Convertibility Checker
by: Courant, Nathanaëlle, et al.
Published: (2025)

A Primal-Dual Perspective on Program Verification Algorithms (Extended Version)
by: Tsukada, Takeshi, et al.
Published: (2025)

Coinductive Proofs for Temporal Hyperliveness
by: Correnson, Arthur, et al.
Published: (2025)

Constructive characterisations of the must-preorder for asynchrony
by: Bernardi, Giovanni, et al.
Published: (2025)