3,431 karma · joined May 14, 2017
- [Remaking Cavestory in c++](https://www.youtube.com/playlist?list=PLNOBk_id22bw6LXhrGfhV...)
- [Dive into C++11/14](https://www.youtube.com/playlist?list=PLTEcWGdSiQenl4YRPvSqW...)
>I see that you have a “HTTPie feature parity checklist” (issue #4) on the issues list. Is that the sole indicator (aside from bugs) of what a version 1.0 would be like?
Yes, that pretty much sums it. Also The list might expand if I notice other HTTPie features I forgot about.
Since I am not planning on writing an extensive documentation for ht, I wanted to port 99% of HTTPie's features so its docs applies to ht as well. So far I have been able to port around 60-70% of HTTPie's features.
- https://typeclasses.com/beginner-crash-course
- https://yannesposito.com/Scratch/en/blog/Haskell-the-Hard-Wa...
[1] https://github.com/ducaale/nyan/blob/feature/lines/examples/...
Meanwhile, I am still unable to how understand how slack's WYSIWYG works.
[1] http://jobjo.github.io/2019/04/24/ocaml-has-some-new-shiny-s...
* [a parser combinator in haskell](https://www.youtube.com/watch?v=N9RUqGYuGfw)
* [stack based language compiler in ocaml](https://www.twitch.tv/videos/654258168)
You can find all the things that were done during the streams in https://github.com/tsoding. You can also find his schedule at https://tsoding.org/schedule/
On the topic of and janestreet-core/base and named parameters, I don't like how it basically forces you to name your arguments whenever you need to compose functions. I much prefer Containers library which is lighter and stdlib friendly.
* Base/Core: List.range 0 20 |> List.map ~f:(fun x -> x * 2) |> (fun l -> List.take l 5)
* Containers: List.range 0 20 |> List.map (fun x -> x * 2) |> List.take 5
- Algebraic data types
- OCaml's let expressions
- F#'s computation expressions
I also think that it is important to write something that naturally requires the use of monads. One thing that spring to mind is Parser Combinators.
- https://fsharpforfunandprofit.com/posts/understanding-parser...
Have you tried using OCaml's monadic let expressions? It was introduced on verion 4.08 and they share similarity with F# computation expressions.
* https://jobjo.github.io/2019/04/24/ocaml-has-some-new-shiny-...
* https://caml.inria.fr/pub/docs/manual-ocaml/bindingops.html
https://www2.lib.uchicago.edu/keith/ocaml-class/class-01.htm...