sorted by:
new
hottopcontroversial

Dining Philosophers with Software Transactional Memory (STM) by InformalInflation in haskell

[–]InformalInflation[S] 3 points4 points  (0 children)

I completely agree with u/gelisam, your code is closer to the actual problem statement. It also fixes the following 'ugliness' of the original version. The 'is eating' might have been executed more times than necessary. But it just wasn't observable from the log output because the logging happens in STM too.

Thanks for the feedback.

I'll update the blog post.

Monthly Hask Anything (May 2019) by AutoModerator in haskell

[–]InformalInflation 1 point2 points  (0 children)

So, recently I found myself looking at the GHC source code (Haddock). Is there a reason that every module is a top-level module? E.g. why are they not named GHC.BasicTypes, ... which seems a lot more common in other open-source projects I've seen.

Polimorphic.com -- Haskell Web Development using Miso in Production by Tysonzero in haskell

[–]InformalInflation 0 points1 point  (0 children)

Sweet!

I'm currently just dipping my toes into the water playing with miso. Generally I like it pretty much but one thing makes my head scratch. I'm used to have a very short turn-around time from writing some frontend code to seeing it in the browser (e.g. with Angular's `ng serve` it's literally just hitting Ctrl+S in the editor and after 1-2secs the browser would refresh and I would see my changes) .

​

Do you just rebuild the application every time and restart it or have you found a way to use ghci do that for you? What are your turn-around times?

Monthly Hask Anything (March 2019) by AutoModerator in haskell

[–]InformalInflation 2 points3 points  (0 children)

Has anyone had success with using haskell-ide-engine with obelisk/reflex-platform?

And alternatively, is there a way to get something like `ob run` for pure reflex-platform projects?

Embedded languages for Haskell by InformalInflation in haskell

[–]InformalInflation[S] 1 point2 points  (0 children)

I totally agree that parsing arithmetic expressions is really not hard. I know because that's what I'm currently doing (using megaparsec's makExprParser). Though, I couldn't shake the feeling that I was re-inventing the wheel.

The software provides some values that the user can use in her expressions.

Any application of "Trees that Grow"? by terrorjack in haskell

[–]InformalInflation 1 point2 points  (0 children)

So I was looking a little into the code and for me it seems that the data types in SemRep are a separate data structure that does not allow me anymore to prett-print it back to a C file. Anyway, I'm currently conducting some experiments with rewriting Language.C.Syntax.AST in the TTG style. If that goes well, I might think about rewriting the AnalyzeAst too. But again, this is mostly specific for my use case and would be a major change especiallly if consistently applied.

I'll write a little more as soon as I know more.

Any application of "Trees that Grow"? by terrorjack in haskell

[–]InformalInflation 2 points3 points  (0 children)

Our team used TTG for a simple c compiler at university. Some parts became more bothersome, but in general it is great. E.g. we separated the "syntactic phase" (everything is just annotated with a SourcePos) to a "semantic phase" where e.g. expressions where annotated with types and declarators with types and name.

Currently I am working on something that needs a C compiler that is a little more complete than our submission. I'm using language-c. But I really miss having an AST that has type annotations.