in this paper, let $l$ be a completeresiduated lattice, and let {bf set} denote the category of setsand mappings, $lf$-{bf pos} denote the category of $lf$-posets and$lf$-monotone mappings, and $lf$-{bf cslat}$(sqcup)$, $lf$-{bfcslat}$(sqcap)$ denote the category of $lf$-completelattices and $lf$-join-preserving mappings and the category of$lf$-complete lattices and $lf$-meet-preserving mapping...

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 de...

Datatype specialization is a form of subtyping that captures program invariants on data structures that are expressed using the convenient and intuitive datatype notation. Of particular interest are structural invariants such as well-formedness. We investigate the use of phantom types for describing datatype specializations. We show that it is possible to express statically-checked specializati...

We describe a model-based planning representation, aimed at capturing more efficiently the basic topological and structural properties of a domain. We specify the syntax of a domain-modelling language based on the proposed representation. We report the experimental results obtained with a prototype system (called PMP, Pattern-Matching Planner) able to represent and solve planning problems expre...

NEUMA is an on-line library that stores collections of symbolic scores and proposes a public interface to search for melodic pieces based on several kinds of patterns: pitchesbased, with or without rhythms, transposed or not. In addition, searches can be either exact or approximate. We describe an index structure apt at supporting all these searches in a consistent setting. Its distinctive feat...

Defining functions by pattern matching over the arguments is advantageous for understanding and reasoning, but it tends to expose the implementation of a datatype. Significant effort has been invested in tackling this loss of modularity; however, decoupling patterns from concrete representations while maintaining soundness of reasoning has been a challenge. Inspired by the development of invert...

Abstract State Machines (ASMs) have been widely used to specify software and hardware systems. Only a few of these specifications are executable, although there are several interpreters and some compilers. This paper introduces a compilation scheme to transform an ASM specification in the syntax of the ASM-Workbench into C++. In particular, we transform algebraic types, pattern matching, functi...

The paper presents a high-level declarative language CO4 for describing constraint systems. The language includes user-defined algebraic data types and recursive functions defined by pattern matching, as well as higher-order and polymorphic types. This language comes with a compiler that transforms a high-level constraint system into a satisfiability problem in propositional logic. This is moti...

Due to the availability of powerful SAT solvers, propositional encoding is a successful technique of solving constraint systems over finite domains. As these domains are often flat and non-structured, the CO4 compiler aims to extend this concept by enriching the underlying domain with user-defined algebraic data types. Syntactically, CO4 is a subset of Haskell and allows to specify constraint s...