More FARM Projects

See ICFP 2026. 

Isidore Mohr - Girard's Paradox as Structure Music. See Demo: Girard’s Paradox as Structure Music by Isidore Mohr.

I present a translation of Girard's paradox into music using Soundproof, an in-progress system for translating proof terms of dependently typed lambda calculus into electronic music according to their tree structure. I explore methods of representing tree structures sonically, and points of choice in the translation and presentation of the result. 


You can listen to the whole album at https://isdra.bandcamp.com/album/girards-paradox.

Claire Wang on what the FARM thing is about (1:23:10) See CompositionCodes YouTube.

Chen Xu - Drawing Algorithms as Modular Objects (starts at 6:08:53) This is really clever. You can abstract structure from random binary matrices by constructing finite automata to recognise certain regular patterns as they appear. Then as you progressively scan the matrix a network of automata appear and disappear according to whether or not the matrix contains an instance of the pattern at that point. Then you can interpret the actions of this system as generators of sounds or patterns.


You can run them at https://algoart.org/studio.html:







 Subscribe to ACM SIGPLAN.

Comments

Post a Comment

Popular posts from this blog

How Could One Unify CMU and MIT

Image
I mean, how to get the best of the two different philosophies of computation. One is based on typed programming languages and the other on engineering with diagrams . This is about practical computing and the cost and feasibility of software development in general. Here is the problem: We have a lot of algorithms which can all be described abstractly using some sort of pseudocode, or perhaps using some particular language (usually Python!). These algorithms are often well-studied and a lot is known about them in terms of their computational complexity in time and space. Substantive practical software systems invariably employ many such algorithms, often implemented in libraries with more or less well-specified APIs. But very few of these libraries are capable of interoperating because they are either packages written in some specific programming language like Java or Haskell, say, or they are written in C and used as object code, or they are written in an interpreted language like Sc...
Read more

Tensor Fields and Simplicial Complexes

Image
Listening to Freya Holmér last night I started to get glimmers of an idea I had long ago about how to represent vector spaces in computational processes using this recursive abstract type :  abstype 'a point = POINT   of {getx :  'a vector,       diff :  'a point -> 'a point,       move :  'a point -> 'a point,       scale : 'a -> 'a point,       proj :  'a point -> 'a} with    fun new i (op +) (op -) (op * ) dot =    let fun self x =  POINT       {getx = x,        move = fn (POINT pr) =>           (self (x + (#getx pr))),        diff = fn (POINT pr) =>          self (x - (#getx pr)),        scale = fn i =>          (self (x * i)),        proj = fn (POINT pr) =>     ...
Read more

HTML in Blog Posts

Just testing stuff: SVG You can click on the blue circle: MathML There is not much you can do with this. See Mathematical Markup Language 1.01 Specification   7.1.5 Mixing and Linking MathML and HTML . It's the big problem  of how you compose languages.   a x 2 + b x + c = 0 You can click on the discriminant: x = − b ± b 2 − 4 ⁢ a ⁢ c 2 ⁢ a 2D Canvas Sound  Beep! WebGPU Next level Parser expression grammar compiler:  https://peggyjs.org/online.html Devine Lu Linvega's unxtal assembler/debugger:  https://wiki.xxi...
Read more