LSLeary’s gists

LSLeary / Coercible.hs

Last active January 5, 2025 10:15

Generalised Coercible

	-- These coercions could probably be generated automatically with a
	-- type class and this plugin:
	-- https://github.com/noughtmare/transitive-constraint-plugin

	{-# LANGUAGE UnboxedTuples, UnliftedNewtypes, ExplicitNamespaces #-}
	{-# LANGUAGE RoleAnnotations, DataKinds, QuantifiedConstraints #-}

	module Coercible (

	Coercible(..),

LSLeary / Yoneda.hs

Last active February 4, 2025 04:00

A more general treatment of the Yoneda lemma than is given in Data.Functor.Yoneda.

	{-# LANGUAGE GHC2021, BlockArguments #-}

	module Yoneda where

	import Prelude hiding (id, (.), map)
	import Control.Category


	-- Preliminaries
	class (Category c, Category d) => ExoFunctor c d f where

LSLeary / Collapse.hs

Last active November 19, 2024 09:08 — forked from VictorTaelin/collapse_monad.hs

A* Collapse Monad (see https://www.reddit.com/r/haskell/comments/1gu476s/the_collapse_monad/lxsyge6/)

	{-# LANGUAGE LambdaCase #-}

	module Collapse where

	-- base
	import Data.Functor ((<&>))
	import Data.Functor.Classes (Show1)
	import Data.Foldable (toList)
	import Control.Monad (ap)

LSLeary / Graded.hs

Last active November 8, 2024 04:36 — forked from axman6/Tracked Exceptions.hs

Checked exceptions implemented by grading IO with the set of exceptions an action may throw.

	{-# LANGUAGE DataKinds, TypeFamilies, UndecidableInstances, RoleAnnotations
	, QuantifiedConstraints, RebindableSyntax, BlockArguments
	, RequiredTypeArguments
	#-}

	module Graded (

	GradedAppl(..), (<>), (<), (*>),
	GradedAlt(..),
	GradedMonad(..), (>>),

LSLeary / 0-InlineFix.hs

Last active October 3, 2024 22:51

Unrolling recursive functions at static arguments using church numerals

LSLeary / LeibnizC.hs

Created September 23, 2024 08:06

Leibniz equality as a quantified constraint with safe reification and reflection

	{-# LANGUAGE QuantifiedConstraints
	, UndecidableInstances
	, AllowAmbiguousTypes
	#-}
	{-# OPTIONS_GHC -Wno-simplifiable-class-constraints #-}

	module LeibnizC where

	import Leibniz

LSLeary / WorkQueue.hs

Last active September 13, 2025 22:21

Transparently hand off jobs to work queues serviced by a dynamic number of workers capable of sending progress reports

	{-# LANGUAGE GADTs, RankNTypes, LambdaCase, BlockArguments #-}

	module WorkQueue (
	Progress(..),
	WorkQueue,
	newWorkQueue,
	newWorkQueueIO,
	spawnWorker,
	schedule,
	terminate,

LSLeary / Sum.hs

Last active August 12, 2024 10:29

An implementation of anonymous sums (AKA variants) with O(1) access, without resorting to Typeable or unsafeCoerce.

LSLeary / Transform.hs

Last active July 23, 2023 04:58

Deriving semidirect products for transformation monoids

	{-# LANGUAGE DerivingVia, PatternSynonyms #-}
	{-# LANGUAGE UndecidableInstances, MonoLocalBinds #-}

	module Transform where

	import Data.Functor ((<&>))
	import Data.Monoid (Sum(..), Product(..), Ap(..))


	test1a :: Transformable p s => Transform p s

LSLeary / Local.hs

Created July 17, 2023 13:36

A "local" quasiquoter, such that [local|<name>|] = Current.Module.<name>.

	module Local (local) where

	import Data.Char (isUpper)
	import Data.Functor ((<&>))

	import Language.Haskell.TH.Syntax
	( Q, Exp(VarE, ConE), Type(ConT)
	, Module(..), Name(..), OccName(..), NameFlavour(NameQ)
	)
	import Language.Haskell.TH.Lib (thisModule)

Leary LSLeary