Dmitry Malikov dmalikov

How to install GHC from source + latest stack + cabal + cabal-install on ubuntu

for your convinience this instuction is available as:
gist
git repo

preferred way install stack than install ghc

stack (package manager and build tool, preferrered way to manage dependencies)

# settings

The Learning Haskell guide has been moved to a git repo to enable outside contribution

Find it here: https://github.com/bitemyapp/learnhaskell

a simple git branching model (written in 2013)

This is a very simple git workflow. It (and variants) is in use by many people. I settled on it after using it very effectively at Athena. GitHub does something similar; Zach Holman mentioned it in this talk.

Update: Woah, thanks for all the attention. Didn't expect this simple rant to get popular.

	-- http://www.cs.ox.ac.uk/ralf.hinze/SSGIP10/AdjointFolds.pdf
	-- http://www.cs.ox.ac.uk/ralf.hinze/publications/SCP-78-11.pdf
	-- https://www.cs.ox.ac.uk/people/nicolas.wu/papers/URS.pdf
	-- https://arxiv.org/pdf/2202.13633.pdf

	{-# LANGUAGE
	MultiParamTypeClasses
	, FunctionalDependencies
	, GADTs
	, PolyKinds

	module Mat where

	open import Function
	open import Data.Empty
	open import Data.Nat using (ℕ; zero; suc)
	open import Data.Fin using (Fin; zero; suc; toℕ)
	open import Data.Fin.Props using ()
	open import Data.Product
	open import Relation.Nullary
	open import Relation.Binary

	using System;

	namespace PureIO {
	/*
	C# does not have proper sum types. They must be emulated.

	This data type is one of 4 possible values:
	- WriteOut, being a pair of a string and A
	- WriteErr, being a pair of a string and A
	- readLine, being a function from string to A

	module type Functor = sig
	type 'a t
	val map : ('a -> 'b) -> 'a t -> 'b t
	end

	module type Lens = sig
	type a
	type b

	module Make(F : Functor) : sig

	#include <tr1/type_traits>
	#include <iostream>
	#include <vector>
	#include <algorithm>

	// (* -> *) -> Constraint
	template<template <typename> class T>
	class Functor {
	public:
	template <typename A, typename B>

	//Provide an implementation of the abstract class Nat that represents non-negative integers
	//
	//Do not use standard numerical classes in this implementation.
	//Rather, implement a sub-object and sub-class:
	//
	//class Zero : Nat
	//class Succ(n: Nat) : Nat
	//
	//One of the number zero, then other for strictly positive numbers.
	namespace Nat