fused-effects VS ghc

Compare fused-effects vs ghc and see what are their differences.

fused-effects

A fast, flexible, fused effect system for Haskell (by fused-effects)

ghc

Mirror of the Glasgow Haskell Compiler. Please submit issues and patches to GHC's Gitlab instance (https://gitlab.haskell.org/ghc/ghc). First time contributors are encouraged to get started with the newcomers info (https://gitlab.haskell.org/ghc/ghc/wikis/contributing). (by ghc)
Our great sponsors
  • SonarQube - Static code analysis for 29 languages.
  • Scout APM - Less time debugging, more time building
  • SaaSHub - Software Alternatives and Reviews
fused-effects ghc
3 55
557 2,705
1.1% 1.0%
8.1 9.9
3 months ago 4 days ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License GNU General Public License v3.0 or later
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.

fused-effects

Posts with mentions or reviews of fused-effects. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-11-17.

ghc

Posts with mentions or reviews of ghc. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-05-15.
  • Roses are red, but unless you're in \{\infty\} \union C, division by zero does not equal infinity
    1 project | reddit.com/r/badmathematics | 23 May 2022
    Haskell has entered the chat. $ ghci GHCi, version 8.8.4: https://www.haskell.org/ghc/ :? for help Prelude> one = 1::Double Prelude> zero = 0::Double Prelude> :t one/zero one/zero :: Double Prelude> one/zero Infinity
  • Basic list construction
    1 project | reddit.com/r/haskellquestions | 20 May 2022
    [email protected] % ghci -XNoImplicitPrelude GHCi, version 8.8.4: https://www.haskell.org/ghc/ :? for help Loaded GHCi configuration from /home/bss/.ghc/ghci.conf GHCi> :{ GHCi| data Nat = Z | S Nat GHCi| GHCi| listNat :: a -> Nat -> a -> [a] GHCi| listNat x y z = l y GHCi| where GHCi| l Z = [z] GHCi| l (S p) = x : l p GHCi| :} data Nat = ... listNat :: a -> Nat -> a -> [a] GHCi> listNat 1 (S (S Z)) 3 [1,1,3] (0.00 secs, 71,512 bytes)
  • Golang Diaries: Generics
    2 projects | news.ycombinator.com | 15 May 2022
  • Calculating number of possible outcomes
    1 project | reddit.com/r/modular | 13 May 2022
    GHCi, version 8.4.3: http://www.haskell.org/ghc/ :? for help Prelude> fact x = if x == 1 then 1 else x * (fact (x-1)) Prelude> (fact 100) - (fact 50) 93326215443944152681699238856266700490715968264381621468592963895217599993229915608941463976126104193051984542783611150085120442072486358431039488000000000000 Prelude> (fact 101) - (fact 51) 9425947759838359420851623124482936749562312794702543768327889353416977599316221476503087861590257228158336107723325356566900403091540004279983013888000000000000 Prelude> ((fact 101) - (fact 51)) / ((fact 100) - (fact 50)) 100.99999999999999
  • How to use Data.Map ! Operator?
    1 project | reddit.com/r/haskell | 13 May 2022
    [email protected] % ghci GHCi, version 8.8.4: https://www.haskell.org/ghc/ :? for help Loaded GHCi configuration from /home/bss/.ghc/ghci.conf GHCi> import Data.Map (0.01 secs, 0 bytes) GHCi> map = fromList [(1,1),(2,3),(5,8)] map :: (Ord k, Num k, Num a) => Map k a (0.04 secs, 24,872 bytes) GHCi> map ! 1 1 it :: Num a => a (0.01 secs, 58,424 bytes) GHCi> map ! 2 3 it :: Num a => a (0.01 secs, 58,424 bytes) GHCi> map ! 3 *** Exception: Map.!: given key is not an element in the map CallStack (from HasCallStack): error, called at libraries/containers/containers/src/Data/Map/Internal.hs:627:17 in containers-0.6.2.1:Data.Map.Internal
  • Does Idris Always Force Prelude?
    1 project | reddit.com/r/Idris | 8 May 2022
  • Haskell Listing
    1 project | reddit.com/r/haskellquestions | 27 Apr 2022
    % ghci GHCi, version 8.8.4: https://www.haskell.org/ghc/ :? for help Loaded GHCi configuration from /home/bss/.ghc/ghci.conf GHCi> data List a = Nil | Cons a (List a) deriving Show data List a = ... (0.02 secs, 0 bytes) GHCi> :{ GHCi| lengthList :: List a -> Int GHCi| lengthList Nil = 0 GHCi| lengthList (Cons _ xs) = 1 + lengthList xs GHCi| :} lengthList :: List a -> Int (0.00 secs, 0 bytes) GHCi> lengthList Nil 0 it :: Int (0.00 secs, 58,752 bytes) GHCi> lengthList (Cons 'a' Nil) 1 it :: Int (0.00 secs, 57,976 bytes) GHCi> lengthList (Cons 123 Nil) 1 it :: Int (0.00 secs, 57,840 bytes) GHCi> lengthList (Cons 1 (Cons 2 (Cons 3 (Cons 4 (Cons 5 (Cons 6 (Cons 7 (Cons 8 (Cons 9 (Cons 10 Nil)))))))))) 10 it :: Int (0.01 secs, 59,584 bytes)
  • Combinations in Haskell
    2 projects | dev.to | 15 Apr 2022
    sh sh> ghci GHCi, version 8.10.7: https://www.haskell.org/ghc/ :? for help Loaded GHCi configuration from /your/home/.config/ghc/ghci.conf λ> :l 2022-04-15-Combinations-TailAfterTail'.lhs [1 of 1] Compiling TailAfterTail ( 2022-04-15-Combinations-TailAfterTail'.lhs, interpreted ) Ok, one module loaded. λ> unsafe_allCombinationsWithSingleStep [1..5] [[[[1]],[[2]],[[3]],[[4]],[[5]]],[[[1,2],[1,3],[1,4],[1,5]],[[2,3],[2,4],[2,5]],[[3,4],[3,5]],[[4,5]]],[[[1,2,3],[1,2,4],[1,2,5],[1,3,4],[1,3,5],[1,4,5]],[[2,3,4],[2,3,5],[2,4,5]],[[3,4,5]]],[[[1,2,3,4],[1,2,3,5],[1,2,4,5],[1,3,4,5]],[[2,3,4,5]]],[[[1,2,3,4,5]]],[[]*** Exception: 2022-04-15-Combinations-TailAfterTail'.lhs:(120,9)-(122,52): Non-exhaustive patterns in function genStep
  • Why is Haskell considered good for writing a Compiler/Interpreter?
    2 projects | reddit.com/r/haskell | 8 Apr 2022
    The GHC runtime system including its core interpreter loop and garbage collector are written in C.
  • Generic Applicative
    1 project | reddit.com/r/haskell | 27 Mar 2022
    The next release of base (4.17) will include the Generically1 newtype which can be used to derive Applicative and I really want to discuss challenges in pushing beyond that.

What are some alternatives?

When comparing fused-effects and ghc you can also consider the following projects:

polysemy - :gemini: higher-order, no-boilerplate monads

eff - 🚧 a work in progress effect system for Haskell 🚧

eveff - Efficient Haskell effect handlers based on evidence translation.

vim-multiple-cursors - True Sublime Text style multiple selections for Vim

in-other-words - A higher-order effect system where the sky's the limit

seed7 - Source code of Seed7

effect-zoo - Comparing Haskell effect systems for ergonomics and speed

TypeScript - TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

fused-effects-optics - Optics combinators for fused-effects.

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

fused-effects-squeal - 🐷🗄️ A fused-effects adapter for squeal-postgresql.