:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Goncharov, Sergey, Milius, Stefan, Schröder, Lutz, Tsampas, Stelios, Urbat, Henning
Formato:	Preprint
Publicado:	2024
Materias:	Logic in Computer Science Programming Languages
Acceso en línea:	https://arxiv.org/abs/2405.16708
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

Bialgebraic Reasoning on Stateful Languages
por: Goncharov, Sergey, et al.
Publicado: (2025)

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

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

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

Big Steps in Higher-Order Mathematical Operational Semantics
por: Goncharov, Sergey, et al.
Publicado: (2025)

Compositionality in Coalgebraic Trace Semantics
por: Jourde, Robin, et al.
Publicado: (2026)

Algebraic Reasoning over Relational Structures
por: Jurka, Jan, et al.
Publicado: (2024)

A Unified Treatment of Substitution for Presheaves, Nominal Sets, Renaming Sets, and so on
por: Lenke, Fabian, et al.
Publicado: (2026)

Intrinsically Correct Algorithms and Recursive Coalgebras
por: Alexandru, Cass, et al.
Publicado: (2025)

Demystifying Codensity Monads via Duality
por: Lenke, Fabian, et al.
Publicado: (2025)

Graded Monads and Behavioural Equivalence Games
por: Ford, Chase, et al.
Publicado: (2022)

Efficient Coalgebraic Partition Refinement
por: Dorsch, Ulrich, et al.
Publicado: (2017)

Redex -> Coq: towards a theory of decidability of Redex's reduction semantics
por: Soldevila, Mallku, et al.
Publicado: (2024)

Well-Founded Coalgebras Meet König's Lemma
por: Urbat, Henning, et al.
Publicado: (2025)

The Only Distributive Law Over the Powerset Monad Is the One You Know
por: Goncharov, Sergey, et al.
Publicado: (2026)

Relators and Notions of Simulation Revisited
por: Goncharov, Sergey, et al.
Publicado: (2025)

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

Higher-Order Asynchronous Effects
por: Ahman, Danel, et al.
Publicado: (2023)

Making first order linear logic a generating grammar
por: Slavnov, Sergey
Publicado: (2022)

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

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

Initial Algebras Unchained -- A Novel Initial Algebra Construction Formalized in Agda
por: Wißmann, Thorsten, et al.
Publicado: (2024)

Identity-Preserving Lax Extensions and Where to Find Them
por: Goncharov, Sergey, et al.
Publicado: (2024)

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

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

Syntactically and semantically regular languages of lambda-terms coincide through logical relations
por: Moreau, Vincent, et al.
Publicado: (2023)

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

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

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

Exact Bayesian Inference for Loopy Probabilistic Programs using Generating Functions
por: Klinkenberg, Lutz, et al.
Publicado: (2023)

Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving
por: Ye, Kangfeng, et al.
Publicado: (2023)

Complete first-order reasoning for functional programs
por: Murali, Adithya, et al.
Publicado: (2026)

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

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

Small Scale Reflection for the Working Lean User
por: Gladshtein, Vladimir, et al.
Publicado: (2024)

A denotationally-based program logic for higher-order store
por: Aagaard, Frederik Lerbjerg, et al.
Publicado: (2023)

Mechanised Hypersafety Proofs about Structured Data: Extended Version
por: Gladshtein, Vladimir, et al.
Publicado: (2024)

Nominal Topology for Data Languages
por: Birkmann, Fabian, et al.
Publicado: (2023)