Abstract
We propose an extension of the join-calculus with pattern matching on algebraic data types. Our initial motivation is twofold: to provide an intuitive semantics of the interaction between concurrency and pattern matching; to define a practical compilation scheme from extended join-definitions into ordinary ones plus ML pattern matching. To assess the correctness of our compilation scheme, we develop a theory of the applied join-calculus, a calculus with value-passing and value matching. © Springer-Verlag 2004.
Cite
CITATION STYLE
Qin, M., & Maranget, L. (2004). Compiling pattern matching in join-patterns. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3170, 417–431. https://doi.org/10.1007/978-3-540-28644-8_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
