FAUST AND REACTIVE FUNCTIONS: A TRACED PROP OF SIGNALS AND SIGNAL RELATIONS

Nicholas Connell

Research output: Chapter in Book/Report/Conference proceedingChapter in a published conference proceeding

Abstract

I propose a categorical interpretation of the algebra presented by Orlarey et al in their paper An Algebra For Block Diagrams [1]. The category in question is the Traced Prop of Relations on Signals. Where Sequential and Parallel composition are relational composition and monoidal product respectively, and Recursive composition is a combination of these, the Trace and more. In this interpretation reactive functions correspond to signal processors. I prove the theorem that the trace of any delayed reactive function is a reactive function. This makes explicit the need for an implicit delay in the definition of Recursion. Furthermore, I show, by way of preserving reactivity and functionality, that each of the five main FAUST operators returns a valid signal processor when fed two of them.

Original languageEnglish
Title of host publicationSMC/JIM/IFC 2022 - Proceedings of the 19th Sound and Music Computing Conference
EditorsRomain Michon, Laurent Pottier, Yann Orlarey
PublisherSound and Music Computing Network
Pages740-749
Number of pages10
ISBN (Electronic)9782958412609
Publication statusPublished - 12 Jul 2022
Externally publishedYes
Event19th Sound and Music Computing Conference, SMC 2022 - Saint-Etienne, France
Duration: 5 Jun 202212 Jun 2022

Publication series

NameProceedings of the Sound and Music Computing Conferences
ISSN (Electronic)2518-3672

Conference

Conference19th Sound and Music Computing Conference, SMC 2022
Country/TerritoryFrance
CitySaint-Etienne
Period5/06/2212/06/22

ASJC Scopus subject areas

  • Music
  • Computer Science Applications
  • Media Technology

Fingerprint

Dive into the research topics of 'FAUST AND REACTIVE FUNCTIONS: A TRACED PROP OF SIGNALS AND SIGNAL RELATIONS'. Together they form a unique fingerprint.

Cite this