Cover Image

Higher-Order Asynchronous Effects

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ahman, Danel, Pretnar, Matija
Format:	Preprint
Published:	2023
Subjects:	Programming Languages Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Strong Normalisation for Asynchronous Effects
by: Ahman, Danel, et al.
Published: (2026)

Comodule Representations of Second-Order Functionals
by: Ahman, Danel, et al.
Published: (2024)

A simple formalization of alpha-equivalence
by: Apinis, Kalmer, et al.
Published: (2025)

Higher Order Automatic Differentiation of Higher Order Functions
by: Huot, Mathieu, et al.
Published: (2021)

Sheaves as oracle computations
by: Ahman, Danel, et al.
Published: (2026)

Bialgebraic Reasoning on Higher-Order Program Equivalence
by: Goncharov, Sergey, et al.
Published: (2024)

Approximate Relational Reasoning for Higher-Order Probabilistic Programs
by: Haselwarter, Philipp G., et al.
Published: (2024)

Logical Predicates in Higher-Order Mathematical Operational Semantics
by: Goncharov, Sergey, et al.
Published: (2024)

Towards a Higher-Order Bialgebraic Denotational Semantics
by: Goncharov, Sergey, et al.
Published: (2026)

On Higher-Order Reachability Games vs May Reachability
by: Asada, Kazuyuki, et al.
Published: (2022)

Tachis: Higher-Order Separation Logic with Credits for Expected Costs
by: Haselwarter, Philipp G., et al.
Published: (2024)

Unfolding Iterators: Specification and Verification of Higher-Order Iterators, in OCaml
by: Chirica, Ion, et al.
Published: (2025)

A Saturation-Based Unification Algorithm for Higher-Order Rational Patterns
by: Chen, Zhibo, et al.
Published: (2023)

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

Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intensional Refinement
by: Timany, Amin, et al.
Published: (2021)

Fair Asynchronous Session Subtyping
by: Bravetti, Mario, et al.
Published: (2021)

Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs
by: Aguirre, Alejandro, et al.
Published: (2024)

Modular Verification of Differential Privacy in Probabilistic Higher-Order Separation Logic (Extended Version)
by: Haselwarter, Philipp G., et al.
Published: (2026)

Crash-Stop Failures in Asynchronous Multiparty Session Types
by: Barwell, Adam D., et al.
Published: (2023)

The Power of Negation in Higher-Order Datalog
by: Charalambidis, Angelos, et al.
Published: (2025)

Towards a Higher-Order Mathematical Operational Semantics
by: Goncharov, Sergey, et al.
Published: (2022)

From Time to Space: The Impact of Linearity in Higher-Order Datalog
by: Charalambidis, Angelos, et al.
Published: (2026)

Higher-order bialgebraic semantics
by: Goncharov, Sergey, et al.
Published: (2024)

Verifying Asynchronous Hyperproperties in Reactive Systems
by: Beutner, Raven, et al.
Published: (2025)

An Order Theory Framework of Recurrence Equations for Static Cost Analysis $-$ Dynamic Inference of Non-Linear Inequality Invariants
by: Rustenholz, Louis, et al.
Published: (2024)

Simplifying explicit subtyping coercions in a polymorphic calculus with effects
by: Koprivec, Filip, et al.
Published: (2024)

Reachability is Decidable for ATM-Typable Finitary PCF with Effect Handlers
by: Endo, Ryunosuke, et al.
Published: (2025)

Outcome Separation Logic: Local Reasoning for Correctness and Incorrectness with Computational Effects
by: Zilberstein, Noam, et al.
Published: (2023)

Outcome Logic: A Unified Approach to the Metatheory of Program Logics with Branching Effects
by: Zilberstein, Noam
Published: (2024)

Verifying an Effect-Handler-Based Define-By-Run Reverse-Mode AD Library
by: de Vilhena, Paulo Emílio, et al.
Published: (2021)

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

The Decision Problem for Regular First-Order Theories
by: Mathur, Umang, et al.
Published: (2024)

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)

On Complexity Bounds and Confluence of Parallel Term Rewriting
by: Baudon, Thaïs, et al.
Published: (2023)

Types, equations, dimensions and the Pi theorem
by: Botta, Nicola, et al.
Published: (2023)

A flexible specification approach for verifying total correctness of fine-grained concurrent modules
by: Fasse, Justus, et al.
Published: (2023)

An Infinite Needle in a Finite Haystack: Finding Infinite Counter-Models in Deductive Verification
by: Elad, Neta, et al.
Published: (2023)

Simply typed convertibility is TOWER-complete even for safe lambda-terms
by: Nguyên, Lê Thành Dũng
Published: (2023)

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