Imagen de Portada

Towards Cumulative Abstract Semantics via Handlers

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Lueker, Cade, Fox, Andrew, Chang, Bor-Yuh Evan
Formato:	Preprint
Publicado:	2025
Materias:	Programming Languages D.3.1 Formal Definitions and Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Towards Automatic Error Recovery in Parsing Expression
por: de Medeiros, Sérgio Queiroz, et al.
Publicado: (2025)

Bridging Chaos Game Representations and $k$-mer Frequencies of DNA Sequences
por: He, Haoze, et al.
Publicado: (2025)

Quasi-stratified Order Semantics of Concurrency
por: Koutny, Maciej, et al.
Publicado: (2024)

LR Parsing of Permutation Phrases
por: Kostičová, Jana
Publicado: (2024)

INTERLEAVE: A Faster Symbolic Algorithm for Maximal End Component Decomposition
por: Bansal, Suguman, et al.
Publicado: (2025)

Grid Programs: A Two-Dimensional, Variable-Free Model of Computation
por: López-Rubio, Ezequiel
Publicado: (2026)

Abstracting Effect Systems for Algebraic Effect Handlers
por: Yoshioka, Takuma, et al.
Publicado: (2024)

Probability and Angelic Nondeterminism with Multiset Semantics
por: Ong, Shawn, et al.
Publicado: (2024)

Quantitative Verification of Omega-regular Properties in Probabilistic Programming
por: Wang, Peixin, et al.
Publicado: (2025)

The Attractor-Cycle Notation for Finite Transformations
por: Egri-Nagy, Attila, et al.
Publicado: (2013)

Specifying and Verifying the Convergence Stairs of the Collatz Program
por: Ebnenasir, Ali
Publicado: (2024)

Non-reducible Modal Transition Systems
por: Basile, Davide
Publicado: (2023)

Learning real-time one-counter automata using polynomially many queries
por: Mathew, Prince, et al.
Publicado: (2024)

Have a thing? Reasoning around recursion with dynamic typing in grounded arithmetic
por: Bobrow, Elliot, et al.
Publicado: (2025)

Inversion by Partial Evaluation: A Reversible Interpreter Experiment
por: Glück, Robert, et al.
Publicado: (2024)

Visualising CTL Witnesses and Counterexamples -- Extended Version
por: Rensink, Arend
Publicado: (2026)

Learn, Check, Test -- Security Testing Using Automata Learning and Model Checking
por: Marksteiner, Stefan, et al.
Publicado: (2025)

Model-bounded monitoring of hybrid systems
por: Waga, Masaki, et al.
Publicado: (2021)

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

Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems (extended version)
por: Geatti, Luca, et al.
Publicado: (2024)

Learning Deterministic One-Counter Automata in Polynomial Time
por: Mathew, Prince, et al.
Publicado: (2025)

Semantics for 2D Rasterization
por: Kulkarni, Bhargav, et al.
Publicado: (2026)

Contract-based Verification of Digital Twins
por: Naeem, Muhammad, et al.
Publicado: (2025)

Gradual Guarantee via Step-Indexed Logical Relations in Agda
por: Siek, Jeremy G.
Publicado: (2024)

A Categorical Framework for Program Semantics and Semantic Abstraction
por: Katsumata, Shin-ya, et al.
Publicado: (2023)

A Diagrammatic Calculus for a Functional Model of Natural Language Semantics
por: Boyer, Matthieu Pierre
Publicado: (2025)

Difficulty Generating Factors for Context-free Language Construction Assignments
por: Schmalstieg, Florian, et al.
Publicado: (2025)

Piecewise Analysis of Probabilistic Programs via $k$-Induction
por: Yang, Tengshun, et al.
Publicado: (2024)

Introducing Linear Implication Types to $λ_{GT}$ for Computing With Incomplete Graphs
por: Sano, Jin, et al.
Publicado: (2025)

Memory Consistency and Program Transformations
por: Gopalakrishnan, Akshay, et al.
Publicado: (2024)

Modular Synthesis of Efficient Quantum Uncomputation
por: Venev, Hristo, et al.
Publicado: (2024)

A Two-Phase Infinite/Finite Low-Level Memory Model
por: Beck, Calvin, et al.
Publicado: (2024)

Flavors of Quantifiers in Hyperlogics
por: Chalupa, Marek, et al.
Publicado: (2025)

Program Analysis via Multiple Context Free Language Reachability
por: Conrado, Giovanna Kobus, et al.
Publicado: (2024)

Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)
por: Nepeivoda, Antonina, et al.
Publicado: (2025)

Quantitative Assurance and Synthesis of Controllers from Activity Diagrams
por: Ye, Kangfeng, et al.
Publicado: (2024)

Scalable Learning of One-Counter Automata via State-Merging Algorithms
por: Guha, Shibashis, et al.
Publicado: (2025)

Close is Good Enough: Component-Based Synthesis Modulo Logical Similarity
por: Mishra, Ashish, et al.
Publicado: (2025)

CBCL: Safe Self-Extending Agent Communication
por: O'Connor, Hugo
Publicado: (2026)

Satisfiability of Context-free String Constraints with Subword-ordering and Transducers
por: Aiswarya, C, et al.
Publicado: (2024)