<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.uni-lj.si/IzpisGradiva.php?id=107596"><dc:title>Behavioural equivalence via modalities for algebraic effects</dc:title><dc:creator>Simpson,	Alex	(Avtor)
	</dc:creator><dc:creator>Voorneveld,	Niels	(Avtor)
	</dc:creator><dc:subject>computer science</dc:subject><dc:subject>behavioural equivalence</dc:subject><dc:subject>call-by-value functional language</dc:subject><dc:subject>openness</dc:subject><dc:subject>decomposability</dc:subject><dc:description>The paper investigates behavioural equivalence between programs in a call-by-value functional language extended with a signature of (algebraic) effect-triggering operations. Two programs are considered as being behaviourally equivalent if they enjoy the same behavioural properties. To formulate this, we define a logic whose formulas specify behavioural properties. A crucial ingredient is a collection of modalities expressing effect-specific aspects of behaviour. We give a general theory of such modalities. If two conditions, openness and decomposability, are satisfied by the modalities then the logically specified behavioural equivalence coincides with a modality-defined notion of applicative bisimilarity, which can be proven to be a congruence by a generalisation of Howe%s method. We show that the openness and decomposability conditions hold for several examples of algebraic effects: nondeterminism, probabilistic choice, global store and input/output.</dc:description><dc:date>2018</dc:date><dc:date>2019-04-29 12:57:58</dc:date><dc:type>Neznano</dc:type><dc:identifier>107596</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
