Extensible constraint syntax through score accessors - Université Paris 8 Vincennes - Saint-Denis Access content directly
Conference Papers Year : 2005

Extensible constraint syntax through score accessors

Mikael Laurson
  • Function : Author
  • PersonId : 1081032


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.
Fichier principal
Vignette du fichier
5.Extensible.pdf (208.09 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03113153 , version 1 (18-01-2021)


  • 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⟩
16 View
24 Download


Gmail Mastodon Facebook X LinkedIn More