We propose and illustrate first steps towards an extension of interaction nets based on monads to handle functions with side effects (e.g., I/O, exceptions). We define three monads for common types of side effects and show their correctness by proving the monad laws
This paper presents a compiler for interaction nets, which, just like term rewriting systems, are us...
International audienceThis paper proposes a general semantic framework for verifying programs with a...
Proving properties about effectful programs is hard. New application-specific abstractions based on ...
This paper presents an implementation device for the weak reduction of interaction nets to interface...
AbstractInteraction nets were introduced almost 15 years ago. Since then they have been put forward ...
Interaction trees are an active development in representing effectful and impure pro- grams in the C...
International audienceWe introduce and study functor-functor and monad-comonad interaction laws as m...
Interaction nets are a graphical formalism inspired by Linear Logicproof-nets often used for studyin...
AbstractReduction rules in Interaction Nets are constrained to pattern match exactly one argument at...
In their purest formulation, monads are used in functional programming for two purposes: (1) to hygi...
This paper explores the use monads to structure functional programs. No prior knowledge of monads or...
Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming (...
AbstractWe propose a conservative extension of interaction nets which offers enriched pattern-matchi...
Many side-effecting programming activities, such as profiling and tracing, can be formulated as cro...
In the world of programming, there are many kinds of languages from which to choose. These varied la...
This paper presents a compiler for interaction nets, which, just like term rewriting systems, are us...
International audienceThis paper proposes a general semantic framework for verifying programs with a...
Proving properties about effectful programs is hard. New application-specific abstractions based on ...
This paper presents an implementation device for the weak reduction of interaction nets to interface...
AbstractInteraction nets were introduced almost 15 years ago. Since then they have been put forward ...
Interaction trees are an active development in representing effectful and impure pro- grams in the C...
International audienceWe introduce and study functor-functor and monad-comonad interaction laws as m...
Interaction nets are a graphical formalism inspired by Linear Logicproof-nets often used for studyin...
AbstractReduction rules in Interaction Nets are constrained to pattern match exactly one argument at...
In their purest formulation, monads are used in functional programming for two purposes: (1) to hygi...
This paper explores the use monads to structure functional programs. No prior knowledge of monads or...
Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming (...
AbstractWe propose a conservative extension of interaction nets which offers enriched pattern-matchi...
Many side-effecting programming activities, such as profiling and tracing, can be formulated as cro...
In the world of programming, there are many kinds of languages from which to choose. These varied la...
This paper presents a compiler for interaction nets, which, just like term rewriting systems, are us...
International audienceThis paper proposes a general semantic framework for verifying programs with a...
Proving properties about effectful programs is hard. New application-specific abstractions based on ...
DOI
Add to ORKG