### Abstract

A patternt, i.e., a term possibly with variables, denotes the set (language) 〚 t〛 of all its ground instances. In an untyped setting, symbolic operations on finite sets of patterns can represent Boolean operations on languages. But for the more expressive patterns needed in declarative languages supporting rich type disciplines such as subtype polymorphism, untyped pattern operations and algorithms break down. We show how they can be properly defined by means of a signature transformation Σ ↦ Σ ^{#} that enriches the types of Σ. We also show that this transformation allows a systematic reduction of the first-order logic properties of an initial order-sorted algebra supporting subtype-polymorphic functions to equivalent properties of an initial many-sorted (i.e., simply typed) algebra. This yields a new, simple proof of the known decidability of the first-order theory of an initial order-sorted algebra.

Original language | English (US) |
---|---|

Pages (from-to) | 423-452 |

Number of pages | 30 |

Journal | Formal Aspects of Computing |

Volume | 29 |

Issue number | 3 |

DOIs | |

State | Published - May 1 2017 |

### Fingerprint

### Keywords

- Initial decidability
- Order-sorted logic
- Pattern operations

### ASJC Scopus subject areas

- Software
- Theoretical Computer Science

### Cite this

*Formal Aspects of Computing*,

*29*(3), 423-452. https://doi.org/10.1007/s00165-017-0415-5