COMP3141
LtuPatternFactory
COMP3141 | LtuPatternFactory | |
---|---|---|
1 | 1 | |
9 | 977 | |
- | - | |
0.0 | 0.0 | |
almost 3 years ago | 4 months ago | |
Haskell | Haskell | |
- | Apache License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
COMP3141
-
COMP3141 and COMP3121
Hi, I did COMP3141 last year before Liam left, so I'm not too sure how much the course content has changed since. Assuming the same content I have written notes that you can find here.
LtuPatternFactory
-
design patterns
You can have a look at this for a beginning primer https://github.com/thma/LtuPatternFactory
What are some alternatives?
perhaps - A monad, perhaps.
r5rs-denot - A correct Scheme interpreter derived from the R5RS spec's formal semantics, written in Haskell.
dep-t - Dependency injection for records-of-functions.
validation-selective - 💂♂️ Lightweight pure validation based on Applicative and Selective functors
monad-control - Lift control operations, like exception catching, through monad transformers
rzk - An experimental proof assistant based on a type theory for synthetic ∞-categories.
discokitty - An educational implementation of some aspects of the DisCoCat framework
monad-metrics-extensible - Type-safe and extensible metrics monad over ekg
design-patterns - Design large-scale systems / 2022 / Design Patterns: Behavioral, Creational, Structural, etc. @ S.Leschev. Google Engineering Level: L6+
tagged-identity - Trivial monad transformer that allows identical monad stacks have different types
categorifier - Interpret Haskell programs into any cartesian closed category.