Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 5 years ago.
Improve this question
If I want to write proofs and algorithms/semantics using Coq on a Haskell program. How can I translate from Haskell to Coq to do this?
It seems that there are tools to translate OCaml programs. But how about Haskell?
The main issue I see in such a translation is that Haskell programs (as well as Ocaml ones) can perform any kind of recursion algorithm, and might contain loops.
In Coq, there is no build-in notion of loops, and any recursive function has to terminate, and be explicit why it terminates.
To the best of my knowledge, there is no such tool at the moment.
Related
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 2 years ago.
Improve this question
I am currently working on the usage of pumping lemma and I need to know why do we use pumping lemma? the main question asked is why?
I know we can prove the non-regularity and I know the formula/proof as well, I'd just like to ask why?
We use the Pumping Lemma IFF we can use it, because in those cases where we can use it, it provides much shorter and simpler proofs than other alternative proof methods.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 6 years ago.
Improve this question
I'd like to learn how to port Haskell code to Frege. Are there any projects that have already been ported and serve as good examples?
Almost all of the existing library code (i.e. Prelude, Data, etc.) have been ported. Also things like QuickCheck, with almost no adaptions.
An interesting case is Data.HashMap which has the same interface as in Haskell, but the implementation relies on Java arrays.
Things to watch out for: unsupported GHC extensions, Strings/Text, code that uses foreign functions (that is, C).
In such cases the Frege analogue of Haskell is usually slightly different, or misses features. Examples would be JSON support and parser combinator libraries (Data.MicroParsec).
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 8 years ago.
Improve this question
I'm looking for a way to derive fmapFirst and fmapSecond for bifunctors automatically. I would prefer a way to do it using the new Generic type class or using Data.Data, and without Template Haskell.
(Note that I already know that https://hackage.haskell.org/package/genifunctors-0.2.2.0/docs/Data-Generics-Genifunctors.html supports this with use of Template Haskell, I wish to know if Template Haskell can be avoided here)
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 8 years ago.
Improve this question
I really think Haskell is a awesome programming language, but it seems that Haskell lacks the handy and mature tools can be used in production.
Does Haskell have a mature, stable and convenient RPC framework to use like Finagle in Scala? Has any one use Haskell in production and how do they handle the communication between different ends?
Thanks.
Yes. There is https://www.haskell.org/haskellwiki/HaXR. If JSON is more your thing then there's also http://hackage.haskell.org/package/json-rpc-server, but that's only for the server side (the same guy is also doing a client library but it's not as mature)
Having said that: RPC should always be the last resort because it's always bad for reliability and performance (this is general programming advice, not specific to Haskell)
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 7 years ago.
Improve this question
Are there any lists of tricky Haskell exercises that use monads in surprising ways floating around? I'm most interested in simple 'work out what this line of code does' or 'do this in point free using this monad' type questions.
Try to figure out why the programs here terminate.
It's not about monads, but these 20 intermediate haskell exercises could make your evening.
http://www.haskell.org/haskellwiki/Blow_your_mind
I don't know what you call tricky, but if you've never tied the knot you should try to make iterative depth first search using knot tying (and make sure it terminates cleanly if no solution is found!).