hierarchical-free-monads-the-most-developed-approach-in-haskell
by graninas
Big article about Hierarchical Free Monads, the most developed approach to build real software in Haskell
AI summary
Haskell programming approach
An in-depth exploration of a Haskell approach to building real-world software, focusing on its benefits and applications.
- stars
- 155
- forks
- 9
- watching
- 9
Similar projects
Found by comparing what the projects do, not just their names.
Haskell software design guide
A comprehensive resource for software design in Haskell, covering various topics and approaches.
Framework
A framework for building concurrent web services and applications with support for multiple databases and libraries.
Monads
An introduction to monads in the Haskell programming language
Linear language
A statically-typed functional programming language with fine-grained program reasoning capabilities
GObject bindings generator
Generates Haskell bindings for GObject Introspection capable libraries
MongoDB driver
Provides a Haskell interface to interact with MongoDB databases.
Haskell tutorial
An automated tutorial program for learning Haskell programming
Haskell GUI library
A cross-platform GUI library for writing native Haskell applications
Monad implementation library
A library for implementing monads by specifying instructions and their operational semantics
Data monad library
A Clojure-based library providing macros and definitions for common data monads.
Parser library
A parser combinator library designed to be industrial-strength and easy to use
Haskell guide
A collection of practical resources and guides for using Haskell in real-world software development projects
Haskell tutorial
A collection of Haskell code examples and resources illustrating the language's features and programming techniques.
Dev productivity framework
A Haskell-based tooling framework designed to enhance developer productivity and newcomer-friendliness.
Haskell compiler
Provides tools and exercises for practicing functional programming in Haskell
