noughtmare’s gists

noughtmare / Main.hs

Created September 10, 2021 17:14

Changing Haskell implementation of k-nucleotide to vector-hashtables.

	{-# LANGUAGE ScopedTypeVariables #-}

	-- The Computer Language Benchmarks Game
	-- https://salsa.debian.org/benchmarksgame-team/benchmarksgame/
	--
	-- Contributed by cahu ette

	module Main where

	import Data.Bits

noughtmare / PrimMonad.bkp

Created September 12, 2021 10:04

Translation of the PrimMonad class to a Backpack signature with example modules that implement it.

	-- vi:syntax=haskell
	{-# LANGUAGE UnboxedTuples, MagicHash, TypeFamilies, StandaloneKindSignatures, RankNTypes, AllowAmbiguousTypes, ConstraintKinds, UndecidableInstances #-}
	unit primmonad-indef where
	signature PrimMonad where
	import Data.Kind
	import GHC.Prim
	type C :: (* -> ) -> -> Constraint
	type family C m s
	type PrimMonad m s = (Monad m, C m s)
	primitive :: PrimMonad m s => (State# s -> (# State# s, a #)) -> m a

noughtmare / PackFusion.hs

Last active March 6, 2022 15:24

An alternative implementation of `pack` for bytestrings that can fuse.

	{-# LANGUAGE MagicHash #-}
	{-# LANGUAGE UnboxedTuples #-}

	module Main (main) where

	import Test.Tasty.Bench

	import qualified Data.ByteString as S
	import qualified Data.ByteString.Internal as SI

noughtmare / type_application_regex

Created March 22, 2022 10:34

A regular expression for finding occurrences of type applications in Haskell code.

^[^-]*(-[^-]+)*(-|[^A-Za-z])either @[(A-Za-z][^@ )]*[ )]

noughtmare / All.hs

Last active September 27, 2022 10:27

Standalone reproducer of missed fusion in vector streams without Skip

	{-# LANGUAGE TypeFamilies #-}
	{-# LANGUAGE TypeFamilyDependencies #-}
	{-# LANGUAGE CPP #-}
	{-# LANGUAGE RoleAnnotations #-}

	module All (test) where

	import Data.Kind
	import Control.Monad.ST
	import Control.Monad.Primitive

noughtmare / EffeGS.hs

Created December 2, 2022 09:24

A symmetric effect system inspired by game semantics.

	{-# LANGUAGE TypeOperators, MultiParamTypeClasses, FlexibleContexts, FlexibleInstances, LambdaCase, DeriveFunctor, DataKinds, GADTs, StandaloneDeriving, NoStarIsType, TypeFamilies, StandaloneKindSignatures, PolyKinds #-}
	{-# OPTIONS_GHC -Wno-unticked-promoted-constructors #-}
	module EffeGS where

	-- TODO:
	-- * Answer-type modification
	-- * Higher order effects
	-- * Cas: the sum/product duality is still asymmetric
	-- solution: session types?

noughtmare / GenerateExponents.hs

Last active February 6, 2023 22:15

Generate Exponents

	import Control.Applicative
	import Data.List (insert, group)
	import Test.Tasty.Bench
	import Control.DeepSeq

	-- only works on infinite lists
	-- op must be lazy in its second argument
	foldb1 :: (a -> a -> a) -> [a] -> a
	foldb1 op = foldb' where
	pairwise ~(x:y:rest) = op x y : pairwise rest

noughtmare / ICN5D2.hs

Last active March 20, 2023 14:08

	{-
	ORIGINAL LICENSE:

	Copyright Stéphane Laurent (c) 2023

	All rights reserved.

	Redistribution and use in source and binary forms, with or without
	modification, are permitted provided that the following conditions are met:

noughtmare / ApplicativeObservableSharing.hs

Last active April 6, 2023 12:27

A prototype of parser combinators which support left recursion.

	{-# LANGUAGE ExplicitNamespaces #-}
	{-# LANGUAGE GADTs #-}
	import Control.Applicative
	import Data.Type.Equality ( type (:~:)(..) )
	import Unsafe.Coerce ( unsafeEqualityProof, UnsafeEquality(UnsafeRefl) )
	import Control.Monad

	newtype Name a = Name ID

	type ID = Int

noughtmare / GLL.hs

Last active May 16, 2023 06:43

Moved to: https://github.com/noughtmare/gigaparsec

	{-# LANGUAGE OverloadedStrings #-}
	{-# LANGUAGE ScopedTypeVariables #-}
	{-# LANGUAGE GADTs #-}
	{-# LANGUAGE StandaloneDeriving #-}
	{-# LANGUAGE DeriveFunctor #-}
	{-# LANGUAGE TypeFamilies #-}
	{-# LANGUAGE InstanceSigs #-}
	{-# LANGUAGE RankNTypes #-}
	{-# LANGUAGE UndecidableInstances #-}
	{-# LANGUAGE DerivingVia #-}

Jaro noughtmare