Relational reasoning on monadic semantics - Archive ouverte HAL
Communication Dans Un Congrès Année : 2025

Relational reasoning on monadic semantics

Résumé

Effectful programs can be given denotational semantics using expressive enough domains. With applications to formally verified compilation in mind, I mechanise an axiomatization of domains with monadic and iteration operators. Refinements between semantics are derived within this abstraction using heterogeneous relations. By using appropriate rules, it is possible to reason about divergence, non-determinism and undefined behaviors. I give a model based on Labeled Transition System which implements those effects. I demonstrate the use of the library with a compositional proof of a Dead Code Elimination transformation.

Fichier principal
Vignette du fichier
jfla2025-final14.pdf (549.69 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04859423 , version 1 (30-12-2024)

Licence

Copyright (Tous droits réservés)

Identifiants

Citer

Benjamin Bonneau. Relational reasoning on monadic semantics. 36es Journées Francophones des Langages Applicatifs (JFLA 2025), Jan 2025, Roiffé, France. ⟨10.5281/zenodo.14508391⟩. ⟨hal-04859423⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More