There are no reviews yet. Be the first to send feedback to the community and the maintainers!
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 Haskellco519-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 materialsessions-in-haskell
Artefact from the POPL'16 paper "Effects as Sessions, Sessions as Effects"ypnos
EDSL for Stencil Computations in Haskellbetty-book-haskell-sessions
Collects examples used to produce the paper 'Session Types with Linearity in Haskell' by Orchard and Yoshida (2017).fibonacci_crisis
Source-code from Fibonacci Crisis performances and practises (written in Sonic Pi v2.0)FirstPrelude
A replacement for Haskell's Prelude library (the standard library) designed for teaching beginners, developed at the University of Kent.coeffects-experiments
Experimenting with coeffect and comonadic semantics embedded in Haskelllambda-club
Material from presentations at the University of Kent's LambdaClub meetingspde-specs
Reproducible PDE models (SSI Collaborations Workshop 2014 Hackday)array-memoize
Memoize discrete functions (restricted to a finite domain) using arrayscomputational-semantics
Fork of the code examples from "Computational Semantics with Functional Programming" (Eijck, Unger) http://www.computational-semantics.eu/temporal-monad
The 'temporal monad' gives a model of the actual-and-virtual-time semantics of the Sonic Pi languageco661-notes
Notes to accompany the lectures of CO661 - Theory and Practice of Concurrency at the University of Kentunfix
Takes a recursive function and syntactically unties the recursive knotlcore
lcore (Lambda Core) A minimal functional programming language based on the lambda calculus and various minimal extensionszipper-solver
A zipper based data structure for rearranging formulaedataflow-effects-as-grades
Classical data-flow analysis (specialised to live-variables) modelled as a graded monadsparsec2D
Adds a 2D parser combinator to Haskell's Parsec library of monadic parser combinatorsstencil-algebra
An (abstract) algebra for stencil computationsconstraintTermExtensions
Prototype implementation of type constraint-term extensions for GHC, accompanying the "Haskell Type Constraints Unleahsed" papermucell
mucell: Multi-cellular, spatial, modelling and simulation toolgeneric-annotate
Data.Generics.Annotategen-type-list
Macro pre-processor that, given a recursive function on lists in Haskell, generates a type-level reification using HLists.constrained-normal
Fork of Neil Sculthorpe's constrained-normal package (http://hackage.haskell.org/package/constrained-normal)stencil-specs
Specifications using Haskell types and constraints for "stencil"-style computations on arraysdatapar
Library implementation of the Cambridge Data Parallel Modeltemplates
My templateswarwick-dcs-robot
Warwick Department of Computer Science Robothaskell-live
Live coding in Haskellerlang-caa-kit
Prototype tools for generating Communicating Actor Automata models from Erlang code, and vice versa,locus
Locus is an experimental declarative language where the distinction between compile-time and run-time code is fluid and manageableLove Open Source and this site? Check out how you can help us