dariusf

Updated July 2022.

Install system dependencies:

brew install --cask mono-mdk dotnet-sdk godot-mono
brew install mono

dariusf

#!/usr/bin/env bash

# This is safe to run in your paper directory, as it creates a copy of the files.
# to be uploaded in the $dest directory below.
# It assumes latexmk is used, and latexmk outputs go into a _build directory.

set -e

# build, as we need the bbl file
latexmk

dariusf

(* #require "containers";; *)
(* open Containers;; *)

type expr =
  | Hole
  | One
  | Plus of expr * expr

type t = int * (expr list -> expr)

dariusf

all:
	dune test --verbose

dariusf

-> start

=== start ===

Let's begin today's standup.

// This records energy level
How are you feeling today?
+ [Green]

dariusf

#!/usr/bin/env python

# Author: Darius Foo ([email protected])
# License: GPLv3

import re
from collections import namedtuple

Frame = namedtuple('Frame', ['fn', 'slots'])
Slot = namedtuple('Slot', ['name', 'value'])

dariusf

#!/usr/bin/env python

# Author: Darius Foo ([email protected])
# License: GPLv3

from z3 import *

set_param(proof=True)
s = Solver()

dariusf

Sub extractHighlighted()

  Dim objUndo As UndoRecord
  Set objUndo = Application.UndoRecord
  objUndo.StartCustomRecord ("Extract Highlighted Text")

  Selection.ClearFormatting
  Selection.HomeKey wdStory, wdMove
  

dariusf

We're looking for pairs of customers who like exactly the same pizza, i.e. their respective sets of liked (and disliked) pizzas are equal.

To get this, we can find customers who differ in their preferences and take the complement of that. The general structure of the answer is thus:

all_pairs_of_customers = ...
customers_who_differ = ...
query = all_pairs_of_customers - customers_who_differ

dariusf

% clingo 5 version of https://gist.github.com/rndmcnlly/cc801233012df3cb0883

%#script (lua) function min(a,b) return math.min(a,b) end #end.
#script (python)
def min1(a,b):
  return min(a,b)
#end.

%% Adam's minimal event calculus formalism:
%% - only true holds/happens are tracked