Trying ghc #haskell for the first time.

It is a decentralized project that allows the storage and transfer of value and assets on the blockchain, just like Ethereum.

Here is a Conversation with Lars Brunjes IOHK Director of Education and Maria Carmo and Keith from Lovelace Academy. Lovelace Academy is one of the winners of Project Catalyst (Cardano Decentralized

When merging the last two posts, I immediately run into serious difficulties. Haskell's type system just made my work harder(well my ignorance did). Until I could come up with a solution, I could not

In this series of posts I'm solving the exercises of Programming Bitcoin[1] in Haskell, I'm learning Bitcoin and Haskell in one go. To describe a point in the elliptic curve, we need four data points.

Bitcoin's price has gone crazy up, and now I'm really responsible for learning it. I found the book Programming Bitcoin[1] by Jimmy Song, it looks good enough to give it a try. It uses Python to teach,

Project Catalyst is a Decentralized Innovation Fund in the Cardano ecosystem, where everyone can submit a proposal idea, and in several stages ADA holders vote which ideas will be funded. Recently Fund3

It’s a classic problem of scale. When a company works on several projects simultaneously, it faces a number of difficulties when it comes to continuous integration services. Running your own CI setup on

seed 发布0.3版本 #wasm #seed Seed是一个Rust前端框架，借助wasm可以创建Web App。 Read More 如何让Haskell搜索字符串与Rust一样快 #haskell

Day 13 is a simulation of carts on tracks. The track layout is given by an ASCII diagram, like this one: /->-\ | | /----\ | /-+--+-\ | | | | | v | \-+-/ \-+--/ \------/ I decided it would be better

Day 12 asks us to implement a cellular automaton. There's a lot of flavor text, but that's basically it. The rules are part of the puzzle; I don't know if they're actually different for everyone or not.

Haskell has a maximum function and it has lazy evaluations of lists. I come from Python that has a max function and list generators. But there turns out to be a crucial difference. Day 11 asks us to find

Day 8's puzzle was basically just about parsing a long list of integers correctly, and writing tree-recursive functions correctly. Both are pretty easy in Haskell. I defined the tree object like this,

I completely gave up on solving the Advent of Code problems as they went up, and I'm backfilling the days I missed, which is most of them. Day 5 was the first time I really felt happy with my Haskell solution,

The Day 7 puzzle is about parallel builds. So, just convert your input into a Makefile and solve it with GNU Make! OK, maybe not. I probably could have gotten that working in less time than it took me

Day 3 and 4 kinda kicked my butt (plus I had work stuff both nights) but I finally finished day 4. It asks us to solve a scheduling problem, and the example even shows us a nice matrix we could use. I

Advent of Code Day 2 asks us to do some string searches. It took me about 40 minutes, and I can't say I'm particularly happy with the results, but it worked. Part 1 asks us to find the number of words

I'm doing Advent of Code in Haskell this year, as planned. I warmed up with one of last year's problems so I was able to get started right away at 11pm last night when the puzzle went live. It still took