You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository was archived by the owner on Oct 16, 2019. It is now read-only.
Copy file name to clipboardExpand all lines: content/issues/107.markdown
+39-11Lines changed: 39 additions & 11 deletions
Original file line number
Diff line number
Diff line change
@@ -9,7 +9,45 @@ Open an issue or pull request [on GitHub](https://github.com/haskellweekly/haske
9
9
10
10
## Featured
11
11
12
-
undefined
12
+
-[A basic introduction to Clash for FPGA Development: Part 2](https://bitlog.it/hardware/a-basic-introduction-to-clash-for-fpga-development-part-2/)
13
+
14
+
> In our previous post, I gave a brief introduction on how to create simple combinatorial hardware in Clash and we ended up with a partly working, ugly circular stack implementation. In this post we will fix the bug, tidy up the code to make it much nicer to read, and simulate our design.
15
+
16
+
-[A purely functional typed approach to trainable models](https://blog.jle.im/entry/purely-functional-typed-models-1.html)
17
+
18
+
> With the release of `backprop`, I've been exploring the space of parameterized models of all sorts, from linear and logistic regression and other statistical models to artificial neural networks, feed-forward and recurrent (stateful).
19
+
20
+
-[Advanced Github: Webhooks and automation](https://mmhaskell.com/blog/2018/5/14/advanced-github-webhooks-and-automation)
21
+
22
+
> For now, we'll conclude our series on deployment by looking at the Github developer API. Most projects you'll work on use Github for version control. But with the API, there are a lot of interesting tricks that can make your experience cooler!
23
+
24
+
-[Error handling in Haskell](https://singpolyma.net/2018/05/error-handling-in-haskell/)
25
+
26
+
> Once the initial decision to have a dynamically typed exception system was made, everything that could make use of an exception-like semantic in any case was bolted on. What am I going to do, though? Write my own ecosystem and runtime that works how I would prefer?
> I followed some ideas from category theory but, being a programmer, I leaned more towards writing code than being preoccupied with mathematical rigor. That left me longing for more elegant proofs of the kind I've seen in mathematical literature.
31
+
32
+
-[Fun with stack: Haskell dependency management](https://jappieklooster.nl/fun-with-stack-haskell-dependency-management.html)
33
+
34
+
> Dependency management in Haskell is complicated. Even if one is able to become productive in the language, any of the problems described here could still make it difficult enough for them to give up on the system they want to build.
35
+
36
+
-[How to Flatpak a Haskell app into Flathub](https://medium.com/@lettier/how-to-flatpak-a-haskell-app-into-flathub-86ef6d69e94d)
37
+
38
+
> Once that last commit goes in, it's time to get your app out there by opening up a distribution channel. One viable Linux app distribution channel is Flathub. To add your app to Flathub, you must first make a Flatpak manifest.
39
+
40
+
-[Introduction to Cabal](https://haskell-at-work.com/episodes/2018-05-13-introduction-to-cabal.html)
41
+
42
+
> In this video we'll explore the basics of Cabal, and how you can use it to package libraries, build executables, run automated tests, and more. We'll also have a look at the family of `new-` commands.
43
+
44
+
-[Objects with special collection routines in GHC's GC](https://well-typed.com/blog/2018/05/ghc-special-gc-objects/)
45
+
46
+
> A generational copying garbage collector, in its most basic form, is quite simple. However, as we'll see, not all objects can be copied, and some objects require more bookkeeping by the RTS.
47
+
48
+
-[Project arbitraries with view patterns](http://blog.ploeh.dk/2018/05/14/project-arbitraries-with-view-patterns/)
49
+
50
+
> Had I been writing F# code, I'd immediately be reaching for an active pattern, but this is Haskell. If there's one thing, though, I've learned about Haskell so far, it's that, if F# can do something, there's a very good chance Haskell can do it too --- only, it may be called something else.
13
51
14
52
## Jobs
15
53
@@ -27,20 +65,10 @@ undefined
27
65
28
66
## In brief
29
67
30
-
-[A basic introduction to Clash for FPGA Development: Part 2](https://bitlog.it/hardware/a-basic-introduction-to-clash-for-fpga-development-part-2/)
31
-
-[A purely functional typed approach to trainable models](https://blog.jle.im/entry/purely-functional-typed-models-1.html)
32
-
-[Advanced Github: Webhooks and automation](https://mmhaskell.com/blog/2018/5/14/advanced-github-webhooks-and-automation)
0 commit comments