thalesmg

// -*- mode: js2 -*-
// ==UserScript==
// @name     VGMRips Auto Random
// @namespace   https://userscripts-mirror.org/users/529924
// @include     https://vgmrips.net/*
// @require     https://vgmrips.net/packs/js/jquery-1.11.0.min.js
// @author      Thales M. G.
// @version  1.0.1
// @grant    none
// @run-at      document-idle

thalesmg

let GitRepo =
      { Type = { repoPath : Text, name : Text, commands : List Text }
      , default.commands =
        [ "git pull", "git push origin master", "git fetch -pa" ]
      }

let Config =
      { Type = { concurrency : Natural, repos : List GitRepo.Type }
      , default = { concurrency = 7, repos = [] : List GitRepo.Type }
      }

thalesmg

#!/usr/bin/env stack
{-
  stack --resolver lts-16.18 script
    --package turtle
    --package text
-}
{-# LANGUAGE OverloadedStrings   #-}
{-# LANGUAGE ScopedTypeVariables #-}
module Main where

thalesmg

let Meme =
      { Type = { path : Text, description : Text, slug : Text }, default = {=} }

let basePath = "/home/thales/Pictures/zoeira/"

let memePath = λ(file : Text) → basePath ++ file

let memes =
      [ Meme::{
        , path = memePath "eyebrows.gif"

thalesmg

// ==UserScript==
// -*- mode: js2; -*-
// @name        Remove ads from google search
// @namespace   https://userscripts-mirror.org/users/529924
// @include     *://*google.com*/search?*
// @include     *://*google.com*/#fp=*
// @include     *://*google.com*/webhp?tab=*
// @include     *://*google.com*/?gws_rd*
// @include     *://*google.com*/#newwindow*
// @grant       none

thalesmg

Delimited Continuations

Delimited continuations manipulate the control flow of programs. Similar to control structures like conditionals or loops they allow to deviate from a sequential flow of control.

We use exception handling as another example for control flow manipulation and later show how to implement it using delimited continuations. Finally, we show that nondeterminism can also be expressed using delimited continuations.

Exception Handling

thalesmg

module Juxt

import Data.HVect
import Data.Vect

From : Type -> Vect n Type -> Vect n Type
From a [] = []
From a (x :: xs) = (a -> x) :: From a xs

juxt : {k : Nat} -> {ts : Vect k Type} -> HVect (From a ts) -> a -> HVect ts

thalesmg

problem 0
BMC: Iteration: 0
BMC: Iteration: 1
BMC: Iteration: 2
BMC: Iteration: 3
BMC: Iteration: 4
BMC: Iteration: 5
BMC: Solution found at iteration 5
Right (5,[S (Stopped,10),S (Down,8),S (Down,6),S (Down,4),S (Down,2),S (Down,0)])

thalesmg

Here's the unusually long linkography from the Zoom chat during World Building in Haskell with Tom Harding:

Perlin noise youtube playlist: https://www.youtube.com/playlist?list=PLRqwX-V7Uu6bgPNQAdxQZpJuJCjeOr7VD

Tom's repo: https://github.com/i-am-tom/world-building-in-haskell/blob/7c75b3711c021bf32f2c4c521accf03a32c7597d/src/Data/Vect.hs

The inventor of Liquid Haskell Ranjit Jhala is funny: https://www.youtube.com/watch?v=Ci48kqp11F8

Fun Prolog stuff, totally off-topic: https://arxiv.org/abs/1809.02840

thalesmg

#!/usr/bin/env stack
{-
  stack --resolver lts-17.4 script
    --package sbv
-}
{-# LANGUAGE DeriveAnyClass     #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE FlexibleInstances  #-}
{-# LANGUAGE NamedFieldPuns     #-}
{-# LANGUAGE StandaloneDeriving #-}