Image de couverture de livre

Higher-order bialgebraic semantics

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Goncharov, Sergey, Milius, Stefan, Schröder, Lutz, Tsampas, Stelios, Urbat, Henning
Format:	Preprint
Publié:	2024
Sujets:	Logic in Computer Science Programming Languages
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Bialgebraic Reasoning on Higher-Order Program Equivalence
par: Goncharov, Sergey, et autres
Publié: (2024)

Towards a Higher-Order Mathematical Operational Semantics
par: Goncharov, Sergey, et autres
Publié: (2022)

Bialgebraic Reasoning on Stateful Languages
par: Goncharov, Sergey, et autres
Publié: (2025)

Logical Predicates in Higher-Order Mathematical Operational Semantics
par: Goncharov, Sergey, et autres
Publié: (2024)

Abstract Operational Methods for Call-by-Push-Value
par: Goncharov, Sergey, et autres
Publié: (2024)

Towards a Higher-Order Bialgebraic Denotational Semantics
par: Goncharov, Sergey, et autres
Publié: (2026)

Big Steps in Higher-Order Mathematical Operational Semantics
par: Goncharov, Sergey, et autres
Publié: (2025)

Compositionality in Coalgebraic Trace Semantics
par: Jourde, Robin, et autres
Publié: (2026)

Algebraic Reasoning over Relational Structures
par: Jurka, Jan, et autres
Publié: (2024)

A Unified Treatment of Substitution for Presheaves, Nominal Sets, Renaming Sets, and so on
par: Lenke, Fabian, et autres
Publié: (2026)

Intrinsically Correct Algorithms and Recursive Coalgebras
par: Alexandru, Cass, et autres
Publié: (2025)

Demystifying Codensity Monads via Duality
par: Lenke, Fabian, et autres
Publié: (2025)

Graded Monads and Behavioural Equivalence Games
par: Ford, Chase, et autres
Publié: (2022)

Redex -> Coq: towards a theory of decidability of Redex's reduction semantics
par: Soldevila, Mallku, et autres
Publié: (2024)

Efficient Coalgebraic Partition Refinement
par: Dorsch, Ulrich, et autres
Publié: (2017)

Well-Founded Coalgebras Meet König's Lemma
par: Urbat, Henning, et autres
Publié: (2025)

Higher Order Automatic Differentiation of Higher Order Functions
par: Huot, Mathieu, et autres
Publié: (2021)

Higher-Order Asynchronous Effects
par: Ahman, Danel, et autres
Publié: (2023)

The Only Distributive Law Over the Powerset Monad Is the One You Know
par: Goncharov, Sergey, et autres
Publié: (2026)

Relators and Notions of Simulation Revisited
par: Goncharov, Sergey, et autres
Publié: (2025)

Approximate Relational Reasoning for Higher-Order Probabilistic Programs
par: Haselwarter, Philipp G., et autres
Publié: (2024)

On Higher-Order Reachability Games vs May Reachability
par: Asada, Kazuyuki, et autres
Publié: (2022)

Making first order linear logic a generating grammar
par: Slavnov, Sergey
Publié: (2022)

Tachis: Higher-Order Separation Logic with Credits for Expected Costs
par: Haselwarter, Philipp G., et autres
Publié: (2024)

Unfolding Iterators: Specification and Verification of Higher-Order Iterators, in OCaml
par: Chirica, Ion, et autres
Publié: (2025)

Contextual Refinement of Higher-Order Concurrent Probabilistic Programs (Extended Version)
par: Li, Kwing Hei, et autres
Publié: (2025)

Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intensional Refinement
par: Timany, Amin, et autres
Publié: (2021)

A Saturation-Based Unification Algorithm for Higher-Order Rational Patterns
par: Chen, Zhibo, et autres
Publié: (2023)

Complete first-order reasoning for functional programs
par: Murali, Adithya, et autres
Publié: (2026)

Exact Bayesian Inference for Loopy Probabilistic Programs using Generating Functions
par: Klinkenberg, Lutz, et autres
Publié: (2023)

Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs
par: Aguirre, Alejandro, et autres
Publié: (2024)

Modular Verification of Differential Privacy in Probabilistic Higher-Order Separation Logic (Extended Version)
par: Haselwarter, Philipp G., et autres
Publié: (2026)

Small Scale Reflection for the Working Lean User
par: Gladshtein, Vladimir, et autres
Publié: (2024)

A denotationally-based program logic for higher-order store
par: Aagaard, Frederik Lerbjerg, et autres
Publié: (2023)

Initial Algebras Unchained -- A Novel Initial Algebra Construction Formalized in Agda
par: Wißmann, Thorsten, et autres
Publié: (2024)

Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving
par: Ye, Kangfeng, et autres
Publié: (2023)

Syntactically and semantically regular languages of lambda-terms coincide through logical relations
par: Moreau, Vincent, et autres
Publié: (2023)

Mechanised Hypersafety Proofs about Structured Data: Extended Version
par: Gladshtein, Vladimir, et autres
Publié: (2024)

On Representability of Multiple-Valued Functions by Linear Lambda Terms Typed with Second-order Polymorphic Type System
par: Matsuoka, Satoshi
Publié: (2026)

Identity-Preserving Lax Extensions and Where to Find Them
par: Goncharov, Sergey, et autres
Publié: (2024)