nponeccop

#!/bin/bash
set -ex -o pipefail
podman build . -t small-tar
podman rm small-tar || true
podman create --name small-tar small-tar /bin/dummycmd
podman cp small-tar:/rootfs.tar rootfs.tar
podman rm small-tar || true

nponeccop

digraph Foo {
"MetaCPAN-Client" -> "LWP-Protocol-https";
"LWP-Protocol-https" -> "Test-RequiresInternet";
"LWP-Protocol-https" -> "libwww-perl";
"libwww-perl" -> "Test-RequiresInternet";
"libwww-perl" -> "Test-Fatal";
"Test-Fatal" -> "Try-Tiny";
"Try-Tiny" -> "CPAN-Meta-Check" [style=dotted];
"CPAN-Meta-Check" -> "Test-Deep";
"Try-Tiny" -> "Capture-Tiny" [style=dotted];

nponeccop

{-# LANGUAGE NoMonomorphismRestriction, Rank2Types #-}
import Control.Monad.Cont

type State s v = s -> (s, v)

set :: a -> State a ()
set x = const (x, ())

get :: State a a
get = \s -> (s, s)

nponeccop

{-# LANGUAGE NoMonomorphismRestriction #-}
{-# LANGUAGE LambdaCase #-}
{-# LANGUAGE TypeFamilies #-}
import Data.Functor.Foldable
import Data.Maybe
import qualified Data.Map as M
listCata :: ListCata a b
listCata = cata

reduceBy :: Ord k => ListAlgebra t b -> (t -> k) -> [t] -> M.Map k b

nponeccop

A part of Hindley Milner type inference/checker

Checks only applications, there are no lets or lambda abstractions :)

Control.Unification comes from unification-fd package.
Unifier.Unifier and Unifier.Restricted can be copy-pasted from https://github.com/nponeccop/HNC/tree/master/Unifier

nponeccop

{-# LANGUAGE LambdaCase #-}
import Unifier.Unifier
import Unifier.Restricted
import Control.Monad.Identity
import Control.Unification (freeVar, freshen, applyBindings)
import Control.Unification.IntVar
import Control.Monad.Trans
import qualified Data.Map as M

data Expression = Atom String | App Expression Expression

nponeccop

{-# LANGUAGE NoMonomorphismRestriction, FlexibleContexts #-}
import Control.Unification (freeVar)
import Control.Unification.IntVar
import Control.Monad.Trans
import Control.Monad.Identity
import Unifier.Unifier
import Unifier.Restricted

t = UTerm . T
ar a b = UTerm $ TT [a, b]

nponeccop

digraph smtp {
  init -> A [label=greet];
  A -> done [label=ehlo];
}

nponeccop

license: gpl-3.0

nponeccop

10 charts of 1070 points each

The axes are still the bottleneck, so I reduced tick count