Dominic Orchard

effect-monad. Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.

type-level-sets. Type-level sets for Haskell (with value-level counterparts and various operations)

navier. Navier-Stokes fluid simulation in various languages (C, Fortran, and Haskell using Repa)

effects-as-sessions. Formalised embedding of an imperative language with effect system into session-typed pi calculus.

codo-notation. Codo notation for programming with comonads in Haskell

co519-logic. Some accompanying lectures notes and resources for CO519 - Theory of Computing (Logic) at the School of Computing, University of Kent.

effectful-explanations-talk. "Programs that explain their effects" talk material

sessions-in-haskell. Artefact from the POPL'16 paper "Effects as Sessions, Sessions as Effects"

ypnos. EDSL for Stencil Computations in Haskell

fibonacci_crisis. Source-code from Fibonacci Crisis performances and practises (written in Sonic Pi v2.0)

betty-book-haskell-sessions. Collects examples used to produce the paper 'Session Types with Linearity in Haskell' by Orchard and Yoshida (2017).

FirstPrelude. A replacement for Haskell's Prelude library (the standard library) designed for teaching beginners, developed at the University of Kent.

lambda-club. Material from presentations at the University of Kent's LambdaClub meetings

coeffects-experiments. Experimenting with coeffect and comonadic semantics embedded in Haskell

pde-specs. Reproducible PDE models (SSI Collaborations Workshop 2014 Hackday)

computational-semantics. Fork of the code examples from "Computational Semantics with Functional Programming" (Eijck, Unger) http://www.computational-semantics.eu/

array-memoize. Memoize discrete functions (restricted to a finite domain) using arrays

temporal-monad. The 'temporal monad' gives a model of the actual-and-virtual-time semantics of the Sonic Pi language

language-fortran. Haskell parser and manipulation functions for Fortran code

co661-notes. Notes to accompany the lectures of CO661 - Theory and Practice of Concurrency at the University of Kent

unfix. Takes a recursive function and syntactically unties the recursive knot

camfort. Light-weight verification and transformation tools for Fortran

zipper-solver. A zipper based data structure for rearranging formulae

lcore. lcore (Lambda Core) A minimal functional programming language based on the lambda calculus and various minimal extensions (developed for 'Lambda Club' at the University of Kent).

mucell. mucell: Multi-cellular, spatial, modelling and simulation tool

stencil-algebra. An (abstract) algebra for stencil computations

dataflow-effects-as-grades. Classical data-flow analysis (specialised to live-variables) modelled as a graded monads

parsec2D. Adds a 2D parser combinator to Haskell's Parsec library of monadic parser combinators

constraintTermExtensions. Prototype implementation of type constraint-term extensions for GHC, accompanying the "Haskell Type Constraints Unleahsed" paper

constrained-normal. Fork of Neil Sculthorpe's constrained-normal package (http://hackage.haskell.org/package/constrained-normal)

generic-annotate. Data.Generics.Annotate

datapar. Library implementation of the Cambridge Data Parallel Model

stencil-specs. Specifications using Haskell types and constraints for "stencil"-style computations on arrays

gen-type-list. Macro pre-processor that, given a recursive function on lists in Haskell, generates a type-level reification using HLists.

comonad. Haskell 98 comonads

predicting-cat-5-damage-to-buildings. Python

containers. Haskell

effect-handlers. Haskell

popl2016-papers. Links to publicly available preprints for the POPL'16 conference