Conference
Bimonadic Semantics for Basic Pattern Matching Calculi
Abstract
The pattern matching calculi introduced by the first author are a refinement of the λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching.While related work in the literature only uses a single monad, typically Maybe, for matchings, we present an axiomatic approach to semantics of these pattern matching calculi using two monads, one for expressions and one for matchings.Although these two …
Authors
Kahl W; Carette J; Ji X
Series
Lecture Notes in Computer Science
Volume
4014
Pagination
pp. 253-273
Publisher
Springer Nature
Publication Date
2006
DOI
10.1007/11783596_16
Conference proceedings
Lecture Notes in Computer Science
ISSN
0302-9743