This paper is a contribution to the search for efficient and high-level mathematical tools to specify and reason about (abstract) programming languages or calculi. Generalising the reduction monads of Ahrens et al., we introduce transition monads, thus covering new applications such as  ???-calculus, ?-calculus, Positive GSOS specifications, differential ?-calculus, and the big-step, simply-typed, call-by-value ?-calculus. Finally, we design a suitable notion of signature for transition monads

Hirschowitz, Tom

Lafont, Ambroise

English

This paper is a contribution to the search for efficient and high-level mathematical tools to specify and reason about (abstract) programming languages or calculi. Generalising the reduction monads of Ahrens et al., we introduce operational monads, thus covering new applications such as the-calculus, Positive GSOS specifications, and the big-step, simply-typed, call-by-value-calculus. Finally, we design a notion of signature for operational monads that covers all our examples

Hirschowitz, André

Archive Ouverte en Sciences de l'Information et de la Communication

Modules over monads and operational semantics

International audienceThis paper is a contribution to the search for efficient and high-level mathematical tools to specify and reason about (abstract) programming languages or calculi. Generalising the reduction monads of Ahrens et al., we introduce transition monads, thus covering new applications such as ̅λμ-calculus, π-calculus, Positive GSOS specifications, differential λ-calculus, and the big-step, simply-typed, call-by-value λ-calculus. Finally, we design a suitable notion of signature for transition monads

Modules over Monads and Operational Semantics

Abstract

Similar works

Full text

Available Versions

Archive Ouverte en Sciences de l'Information et de la Communication

HAL-Univ-Nantes

HAL Université de Savoie

INRIA a CCSD electronic archive server

Dagstuhl Research Online Publication Server