dyokomizo

deception creek

a fast moving mountain creek.
    the water cold and crisp
                   and fresh.
         flowing over stones,
               smooth stones,
                  of  yellow,
                       green,
                        blue,

dyokomizo

What can you do today to help humanity with The Ultimate List of Worries, in Priority Order?

---

Around 780,000,000 people live with less than $1.9 per day.

An average of 913 people will die today from hunger (based on 2017 statistics for deaths from "Nutritional deficiencies" and "Protein-energy malnutrition").

$1 will make a difference in that life and death situation.

dyokomizo

Pentasensoplexia

---

I say one thing
    you      hear and understand another
    which is neither       what  I said
             nor           what  the words themselves
                                 became

dyokomizo

Keybase proof

I hereby claim:

• I am dyokomizo on github.
• I am dyokomizo (https://keybase.io/dyokomizo) on keybase.
• I have a public key whose fingerprint is D9C5 CF0E CBB2 D3B1 BA10 7652 C854 7892 F6F4 7116

To claim this, I am signing this object:

dyokomizo

#!/bin/bash

: ${POMODORO_ALARM:="/usr/share/sounds/freedesktop/stereo/alarm-clock-elapsed.oga"}

cycle () {
  [[ $# > 1 ]] && (echo $2);
  for i in $(seq 1 $1);
  do
    if [ $(($i % 5)) -eq 0 ]
    then

dyokomizo

did:3:bafyreifh5pvlq62imfuu2faajxgrb4orlgcmx64rmb6odyaig7hv7edl3u

dyokomizo

$ ghci
GHCi, version 7.10.3: http://www.haskell.org/ghc/  :? for help
Prelude> let z = \s z -> z
Prelude> let s = \n s z -> s $ n s z
Prelude> let unchurch n = n (+1) 0
Prelude> unchurch z
0
Prelude> let n1 = s z
Prelude> let n2 = s $ s z
Prelude> let n3 = s $ s $ s z

dyokomizo

{-# LANGUAGE DataKinds, TypeOperators, StandaloneDeriving, KindSignatures, FlexibleInstances, FlexibleContexts, GADTs, TypeFamilies, UndecidableInstances
  #-}
module Algebra where
  
  type family Delete a b where
    Delete a '[] = '[]
    Delete a (a ': t) = Delete a t
    Delete a (h ': t) = h ': Delete a t

  type family Union a b where

dyokomizo

2006 - Agreeing to Agree - Conflict Resolution for Optimistically Replicated Data
2007 - Designing a Commutative Replicated Data Type
2009 - CRDTs - Consistency without Concurrency Control
2011 - A Comprehensive Study of Convergent and Commutative Replicated Data Types
2011 - Conflict-free Replicated Data Types
2011 - Optimistic Concurrency Control by Melding Trees
2012 - A Lattice-Theoretical Approach to Deterministic Parallelism with Shared State
2012 - An Optimized Conflict-free Replicated Set
2012 - Brief Announcement: Semantics of Eventually Consistent Replicated Sets
2012 - Key-CRDT Stores

dyokomizo

#lang racket

(define eval   [lambda (p  ) (eval/s p '())])
(define eval/s [lambda (p s) (eval/k p s (lambda (x) x))])

(define eval/k
  [lambda (p s k)
    (cond {(eq? p '()) (k s)}
          {(number? (car p)) (eval/k (cdr p) s [lambda (s) (k (cons (car p) s))])}
          {(eq? (car p) 'dup) (eval/k (cdr p) s [lambda (s) (k (cons (car s) (cons (car s) (cdr s))))])}