MonoidMusician

{
  "[email protected]":
    300,
  "[email protected]":
    537,
  "[email protected]":
    513,
  "[email protected]":
    398,
  "[email protected]":

MonoidMusician

# pseudo-assembly for a turing machine

# tape layout for SAT problem in nvar variables with CNF of length len
# (convenient to assume len >= nvar to make a single measure of complexity)
# we will be deleting clauses as we go, but otherwise the tape stays constant

# nvar variables, 3 bits each
nvar * <notSIGIL=0><mut mark=0><value>
# sigil separating variable table from CNF
<SIGIL=1>

MonoidMusician

module coefin.notarealagdafile where

-- This would be great syntax, but I don't think we can make it all implicit


------------------------------
-- Number/Numeral nonsense: --
------------------------------

-- `Fin` is an implicit coercion

MonoidMusician

#!/usr/bin/env python3

import re
import sys
# install this dependency from pip:
from wrapt import ObjectProxy

class FormattableMatch(ObjectProxy):
  def __str__(self):
    m = self.__wrapped__

MonoidMusician

#!/usr/bin/env python3
import subprocess
from time import sleep
import sys

buggy = True

file = "'" + sys.argv[1] + "'"

p = subprocess.Popen(["fish" if buggy else "bash", "-c", "ffplay -nodisp -autoexit -hide_banner -loglevel error " + file])

MonoidMusician

// Silly little syntax sugars :3

// _.name({name:"hello"}) == "hello"
// mk.name("hello") == {name: "hello"}
// _pipe.join(", ").length.line_(["do", "re", "mi"]) == 10

// Create a simple proxy for syntactic sugar for method names and function calls
const sugar = (handler, applier=undefined) => new Proxy(applier ? ()=>{} : {}, {
  get: (_target, property, _thisArg) => {
    return handler(property);