Gabor Greif ggreif

ramirez7 / UnsaturatedMultiConstraint_polymorphic-matchability.hs

Last active June 19, 2019 22:18

	{-# LANGUAGE PolyKinds #-}
	{-# LANGUAGE DataKinds #-}
	{-# LANGUAGE GADTs #-}
	{-# LANGUAGE RankNTypes #-}
	{-# LANGUAGE UnsaturatedTypeFamilies #-}
	{-# LANGUAGE TypeOperators #-}

	module Main where

	import Data.Kind

avieth / gist:334201aa341d9a00c7fc

Last active July 22, 2022 13:42

Interpreting Free Monads of Functor Sums

	Interpreting Free Monads of Functor Sums
	========================================

	This text deals with a way to compose certain kinds of monads, thereby mixing
	their capabilities. It is a literate Haskell file, so let's begin with a
	bunch of noise.

	> {-# LANGUAGE MultiParamTypeClasses #-}
	> {-# LANGUAGE FlexibleInstances #-}
	> {-# LANGUAGE FlexibleContexts #-}

kasbah / tree.hs

Last active August 29, 2015 14:05

A binary fractal tree ported from Elm to Helm.

	--license: CC-0
	--see: https://creativecommons.org/publicdomain/zero/1.0/

	--Elm version: http://share-elm.com/sprout/53ee4e81e4b07afa6f9844c9

	import FRP.Helm
	import qualified FRP.Helm.Window as Window
	import qualified FRP.Helm.Mouse as Mouse

	data Branch = Branch { branch_x1 :: Double

gelisam / Main.hs

Last active December 21, 2024 10:19

IndexedMonad example

	-- in reply to http://www.reddit.com/r/haskell/comments/21mja6/make_lllegal_state_transitions_unrepresentable/
	--
	-- We implement a tiny language with three commands: Open, Close, and Get.
	-- The first Get after an Open returns 1, the second Get returns 2, and so on.
	--
	-- Get is only valid while the state is open, and
	-- Open must always be matched by a Close.
	-- We enforce both restrictions via the type system.
	--
	-- There are two valid states: Opened and Closed.