Skip to Main content Skip to Navigation
Conference papers

Extensible constraint syntax through score accessors

Abstract : We present in this paper our recent developments dealing with constraint-based programming. Our focus is in a new syntax that extends the pattern-matching part of our rule system. The syntax allows to refer to more high-level entities in a score than before, resulting in compact rules that use only a minimal set of primitives. The system can be used to define a wide range of cases ranging from melodic, harmonic and voice-leading rules. The compiler can be extended to support new score accessor keywords by special compiler methods. The new syntax is explained and demonstrated with the help of a large number of rule examples.
Complete list of metadata
Contributor : Administrateur HAL Paris 8 Connect in order to contact the contributor
Submitted on : Monday, January 18, 2021 - 10:39:16 AM
Last modification on : Thursday, July 14, 2022 - 3:53:20 AM
Long-term archiving on: : Monday, April 19, 2021 - 6:37:19 PM


Files produced by the author(s)


  • HAL Id : hal-03113153, version 1


Mikael Laurson, Mika Kuuskankare. Extensible constraint syntax through score accessors. Journées d'Informatique Musicale, Association Française d'Informatique Musicale; Centre de recherche en Informatique et Création Musicale, Jun 2005, Paris, France. ⟨hal-03113153⟩



Record views


Files downloads