effect-zoo
ghc
Our great sponsors
effect-zoo | ghc | |
---|---|---|
1 | 53 | |
55 | 2,703 | |
- | 0.9% | |
0.0 | 9.9 | |
about 1 year ago | 5 days ago | |
Haskell | Haskell | |
BSD 3-clause "New" or "Revised" License | GNU General Public License v3.0 or later |
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.
effect-zoo
-
Monthly Hask Anything (June 2021)
Did you mean: https://github.com/ocharles/effect-zoo?
ghc
- Golang Diaries: Generics
-
Calculating number of possible outcomes
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?
[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?
-
Haskell Listing
% 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
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?
The GHC runtime system including its core interpreter loop and garbage collector are written in C.
-
Generic Applicative
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.
-
GHCI not starting, can't load .so/.DLL
> ghci GHCi, version 8.6.5: http://www.haskell.org/ghc/ :? for help Loaded package environment from /home/aradarbel10/dev/SetLang/.ghc.environment.x86_64-linux-8.6.5 : can't load .so/.DLL for: /home/aradarbel10/.cache/hie-bios/dist-SetLang-437248df16c34d32a86e190a0bde5561/build/x86_64-linux/ghc-8.6.5/SetLang-0.1.0.0/build/libHSSetLang-0.1.0.0-inplace-ghc8.6.5.so (/home/aradarbel10/.cache/hie-bios/dist-SetLang-437248df16c34d32a86e190a0bde5561/build/x86_64-linux/ghc-8.6.5/SetLang-0.1.0.0/build/libHSSetLang-0.1.0.0-inplace-ghc8.6.5.so: undefined symbol: SetLangzm0zi1zi0zi0zminplace_EUF_Eq_con_info)
-
liftM destroys laziness
$ ghci GHCi, version 8.10.7: https://www.haskell.org/ghc/ :? for help Prelude _> import Control.Monad.Identity Prelude Control.Monad.Identity _> liftM2 (||) (pure True) undefined :: Identity Bool Identity True Prelude Control.Monad.Identity _> liftM2 (||) (pure True) undefined :: IO Bool *** Exception: Prelude.undefined CallStack (from HasCallStack): error, called at libraries/base/GHC/Err.hs:79:14 in base:GHC.Err undefined, called at :5:25 in interactive:Ghci2
What are some alternatives?
vim-multiple-cursors - True Sublime Text style multiple selections for Vim
seed7 - Source code of Seed7
in-other-words - A higher-order effect system where the sky's the limit
polysemy - :gemini: higher-order, no-boilerplate monads
TypeScript - TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
linear - Low-dimensional linear algebra primitives for Haskell.
frp-zoo - Comparing many FRP implementations by reimplementing the same toy app in each.
FiraCode - Free monospaced font with programming ligatures
hop.nvim - Neovim motions on speed!
fused-effects - A fast, flexible, fused effect system for Haskell
Vim - The official Vim repository
vim-cool - A very simple plugin that makes hlsearch more useful.