Stephen Diehl sdiehl

## threads.md

      
              1 file
            
          
              0 forks
            
          
                0 comments
              
            
              21 stars
            
          
                sdiehl
                / threads.md
            
            
              Last active
              April 10, 2022 11:37
            
              
                Twitter threads from @SMDiehl on Crypto Skepticism
              
          
    Twitter threads from @smdiehl  on Crypto Skepticism

Bitcoin - https://twitter.com/smdiehl/status/1349307219318345728
Environemtal Impact of Mining - https://twitter.com/smdiehl/status/1350869944888664064
Ransomware & Extortion - https://twitter.com/smdiehl/status/1353369991022784515
Cryptocurrency Exchanges - https://twitter.com/smdiehl/status/1355227881065082888
Toxic Culture of Cryptocurrency - https://twitter.com/smdiehl/status/1358860077168537610
Phoney Populism - https://twitter.com/smdiehl/status/1360504285440708611
Whataboutism - https://twitter.com/smdiehl/status/1363418896301228033
Investment Properties - https://twitter.com/smdiehl/status/1367409708517236736


## church.py
TRUE = lambda x: lambda y: x
FALSE = lambda x: lambda y: y
Product = lambda x: lambda y: lambda z: (z)(x)(y)
And = lambda x: lambda y: (x)(y)(x)
Not = lambda x: lambda y: lambda z: (x)(z)(y)
Boolean = (Product)(True)(False)
Succ = lambda x: lambda y: lambda z: (y)((x)(y)(z))
Pred = lambda x: lambda y: lambda z: x(lambda i: lambda j: j(i(y))) (lambda k: z) (lambda k: k)
Y = lambda g: (lambda z:z(z)) (lambda f: g(lambda arg: f(f)(arg)))
Nth = Y(lambda f: lambda n: Succ(f(n-1)) if n else Zero)

## berlin_talk.md

      
              1 file
            
          
              3 forks
            
          
                1 comment
              
            
              15 stars
            
          
                sdiehl
                / berlin_talk.md
            
            
              Last active
              May 31, 2023 13:17
            
          
    Haskell Problems for a New Decade

[Haskell For a New
Decade]
History of Haskell

[Wearing the hair shirt: a retrospective on Haskell
(2003)]

  
## diehl_2019.md

      
              1 file
            
          
              0 forks
            
          
                0 comments
              
            
              3 stars
            
          
                sdiehl
                / diehl_2019.md
            
            
              Created
              March 17, 2020 10:50
            
              
                2019 Reading List
              
          
Absolution Gap - Alastair Reynolds
Abundance - Peter H Diamandis
Advances in Active Portfolio Management - Richard Grinold
Advances in Unconventional Computing - Andrew Adamatzky
Creating Modern Capitalism - Thomas Mccraw
Exhalation - Ted Chiang
From Bacteria to Bach and Back - Daniel C. Dennett
Human Compatible - Russell Stuart
Look To Windward - Iain M. Banks
Lost in Math - Sabine Hossenfelder


## Main.hs
{-# LANGUAGE ForeignFunctionInterface #-}
{-# LANGUAGE GHCForeignImportPrim #-}
{-# LANGUAGE MagicHash #-}
{-# LANGUAGE UnliftedFFITypes #-}

module Main where

import GHC.Prim
import GHC.Word

## installing_unison.md

      
              1 file
            
          
              0 forks
            
          
                0 comments
              
            
              0 stars
            
          
                sdiehl
                / installing_unison.md
            
            
              Created
              November 9, 2019 14:22
            
          
    Install Stack.
$ curl -sSL https://get.haskellstack.org/ | sh
$ stack setup
Install Unison from source.


## fails.hs
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE QuantifiedConstraints #-}

module Test where

## DataTypeName.hs
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE FlexibleContexts #-}

module Test where

import GHC.Generics
import Data.Proxy

typeName :: forall a. (Generic a, GTypeName (Rep a)) => Proxy a -> String
typeName Proxy = gtypename (from (undefined :: a))

## dict.sh
rivendell% stack ghci                                                                                                                          not sandboxed
Configuring GHCi with the following packages:
GHCi, version 8.0.1: http://www.haskell.org/ghc/  :? for help
Loaded GHCi configuration from /home/sdiehl/.ghci
Loaded GHCi configuration from /tmp/ghci18272/ghci-script
λ> class Foo a where { foo :: a -> Int }
λ> instance Foo () where { foo _ = 3 }
λ> bar = foo ()
λ> bar
3

## list_combinator.hs
list :: [b] -> (a -> b) -> [a] -> [b]
list def f xs = case xs of
  [] -> def
  _  -> fmap f xs

example :: [String]
example = list ["a"] show [1,2,3]
	TRUE = lambda x: lambda y: x
	FALSE = lambda x: lambda y: y
	Product = lambda x: lambda y: lambda z: (z)(x)(y)
	And = lambda x: lambda y: (x)(y)(x)
	Not = lambda x: lambda y: lambda z: (x)(z)(y)
	Boolean = (Product)(True)(False)
	Succ = lambda x: lambda y: lambda z: (y)((x)(y)(z))
	Pred = lambda x: lambda y: lambda z: x(lambda i: lambda j: j(i(y))) (lambda k: z) (lambda k: k)
	Y = lambda g: (lambda z:z(z)) (lambda f: g(lambda arg: f(f)(arg)))
	Nth = Y(lambda f: lambda n: Succ(f(n-1)) if n else Zero)
	{-# LANGUAGE ForeignFunctionInterface #-}
	{-# LANGUAGE GHCForeignImportPrim #-}
	{-# LANGUAGE MagicHash #-}
	{-# LANGUAGE UnliftedFFITypes #-}

	module Main where

	import GHC.Prim
	import GHC.Word
	{-# LANGUAGE OverloadedStrings #-}
	{-# LANGUAGE FlexibleInstances #-}
	{-# LANGUAGE FlexibleContexts #-}
	{-# LANGUAGE ScopedTypeVariables #-}
	{-# LANGUAGE DataKinds #-}
	{-# LANGUAGE MultiParamTypeClasses #-}
	{-# LANGUAGE KindSignatures #-}
	{-# LANGUAGE QuantifiedConstraints #-}

	module Test where
	rivendell% stack ghci not sandboxed
	Configuring GHCi with the following packages:
	GHCi, version 8.0.1: http://www.haskell.org/ghc/ :? for help
	Loaded GHCi configuration from /home/sdiehl/.ghci
	Loaded GHCi configuration from /tmp/ghci18272/ghci-script
	λ> class Foo a where { foo :: a -> Int }
	λ> instance Foo () where { foo _ = 3 }
	λ> bar = foo ()
	λ> bar
	3
	list :: [b] -> (a -> b) -> [a] -> [b]
	list def f xs = case xs of
	[] -> def
	_ -> fmap f xs

	example :: [String]
	example = list ["a"] show [1,2,3]