#programming-language #sound #music #mimium #test #generate #infrastructural

mimium-lang

mimium(minimal-musical-medium) an infrastructural programming language for sound and music

2 releases

new 2.0.0-alpha2 Nov 18, 2024
2.0.0-alpha-1 Nov 14, 2024

#1 in #mimium

Download history 105/week @ 2024-11-10

105 downloads per month
Used in 5 crates

MPL-2.0 and LGPL-3.0

340KB
9K SLoC

mimium

Test(main) Test(dev)

a programming language as an infrastructure for sound and music

An icon of the mimium. The word “mimium” is written in small caps, white letters at an angle on a gray diamond-shaped background with a gradient. The vertical bars of the letters are evenly spaced, making it look like a pedestrian crossing.


mimium(MInimal-Musical-medIUM) is a programming language for sound and music.

mimium is made to be an infrastructure for distributing music in a form of a source code, not only a tool for musicians and programmers.

Its semantics are technically inspired from several modern programming languages for sound such as Faust and Extempore.

A minimal example below generates a sinewave of 440Hz.

// minimal.mmm
let twopi = 3.141595*2.0
let sr = 48000.0
fn dsp(){
  sin(now * 440.0 * twopi / sr)
}

A special keyword self can be used in function, which is a last return value of the function. This enables an easy and clean expression of feedback connection of signal chain.

fn lpf(input,fb){    
     (1.0-fb)*input + fb*self
}

You can also write a note-level processing by using @ operator which specifies the time when the function will be executed. Another special keyword now can be used for getting current logical time. An event scheduling is sample-accurate because the scheduler is driven by an audio driver.

freq = 440.0
fn noteloop(){
    freq = (freq+1200.0)%4000.0
    noteloop()@(now + 48000.0)
}

Also, the language design is based on the call by value lambda calculus, so the higher-order functions are supported to express generative signal graph like replicatiing multiple oscillators like the code below.

fn replicate(n){
    if (n>0.0){
        let c = replicate(n - 1.0,gen)
        let g = gen()
        |x,rate| {g(x,rate) + c(x+100.0,rate+0.1)}
    }else{
        |x,rate| { 0.0 }
    }
}

This repository is for a mimium version 2, all the code base is rewritten in Rust while the original was in C++, and Semantics of the language was re-designed. The code is still very under development.

Installation

TODO

Development

See Development section.

Contributing

There's no concrete way for contributing to the mimium project for now but any type of contribution (bugfix, code refactoring, documentation, showing the usecases, etc).

(However, because the mimium is still early stage of the development and there's much things to do, the proposal or request for new feature without Pull Request will not be accepted.)

Take a look at Code of Conduct before you make contribution.

License

©️ the mimium development community.

The source code is licensed under the Mozilla Puclic License 2.0 (MPL2.0).

Original Author

Tomoya Matsuura/松浦知也 https://matsuuratomoya.com/en

Acknowledgements

This project is supported grants and scholarships as follows.

  • 2019 Exploratory IT Human Resources Project (The MITOU Program) by IPA: INFORMATION-TECHNOLOGY PROMOTION AGENCY, Japan.
  • Kakehashi Foundation
  • JSPS Kakenhi 23K12059 "Civil Engineering of Music, as a Practice and Critics between Music and Engineering"

Contributers

This list contains the contributers from v1 development, documentation and financial sponsors(via github sponsor).

Source Code Contributions

Other forms of Contributions

(Memo) Roadmap toward version 2

  • Basic Data Types
    • AST
    • MIR
    • VM Instructions
  • Aggregate Types
    • Tuple (Vector) types
  • Compilers
    • Stateful Functions
      • Feedback with self
      • Delay and mem
    • Parser
    • MIR Generation
      • Type Inference
      • Code Generation
    • VM Code Generation
  • Runtime
    • Audio Driver Backend
      • CPAL implmentation
    • Logical Scheduler
      • auto de-allocation of unused closure
      • destructive assignment of closure upvalues
      • schedule (@) operator
    • Runtime value
      • now
      • samplerate
    • VM
      • Closure upvalue implementation
      • StateStorage implementation
    • simple file include
    • simple audio file reader function
      • array(slice) type & automatic interporation

Further Plans

  • Multi-stage computation (Hygienic Macro)
  • Generics
  • Native & WASM backend with Cranelift
  • Module System, Package Manager
  • effect system for managing statefull function and IO

other todos: Migrating examples

Dependencies

~5–16MB
~141K SLoC