







The “park bench” panel at the Haskell eXchange last week talked about a lot of things, but some of them can be summarised by the question ...
Co-Creator of Haskell: Functional Programming, Thinking in Types, Useless Languages | Simon Jones
Integrating functional and imperative programming | Proceedings of the 1986 ACM conference on LISP and functional programming
We present a new model, based on monads, for performing input/output in a non-strict, purely functional language. It is composable, extensible, efficient, requires no extensions to the type system, and extends smoothly to incorporate mixed-language ...
Implementing a Hindley-Milner Type System (Part 1) | Blog
First part of a tutorial on implementing a Hindley-Milner type system for a simple, purely functional programming language in Haskell. We go over syntax representation, how the Hindley-Milner type system is defined, polymorphism vs. monomorphism, generalization, and instantiation.
Functional programming with bananas, lenses, envelopes and barbed wire
We develop a calculus for lazy functional programming based on recursion operators associated with data type definitions. For these operators we derive various algebraic laws that are useful in deriving and manipulating programs. We shall show that all example functions in Bird and Wadler's “Introduction to Functional Programming” can be expressed using these operators.

Graphics and FPL: Porting a Haskell graphics framework to Rust (luminance)
I wanted to write that new article to discuss about something important I’ve been doing for several weeks. It’s actually been a month that ...
Write You a Haskell ( Stephen Diehl )
The Coalton Programming Language
A statically typed, functional programming language that compiles to Common Lisp
Kwang's Haskell Blog - Scott encoding of Algebraic Data Types
It is well known that algebraic data types can be encoded in a functional programming language by higher order functions. The Church encoding is the most famous one, but there is a lesser known encoding, called Scott encoding. The Scott encoding is generally considered as better.
Haskell: A Great Procedural Language
These sound like dismissals or absurdities from the outside, but once you learn what they really mean, they take on a new light. In this article, I want to explain the third. (See the appendix if you are curious about the first two.)
Category Theory for Programmers: The Preface
Table of Contents Part One Category: The Essence of Composition Types and Functions Categories Great and Small Kleisli Categories Products and Coproducts Simple Algebraic Data Types Functors Functo…

Programming Language Foundations in Agda – Table of Contents
This book is an introduction to programming language theory using the proof assistant Agda.
bmillwood/bluesky-tools
Haskell library providing tools for working with the Bluesky social network / the AT protocol
Combinatory Logic
Explore combinatory logic, combinator birds, and tacit programming across different languages like BQN, J, APL, and Haskell.