Stack always downloads ghc even though it is in path
I want to use Haskell on my computer currently running Windows 10 build 1803, and I am using a broadband connection of 25 Mbps. As of 2018, the Haskell compiler version known as ghc is 8.4.3.
First I download the stack from www.haskellstack.org/ The download is pretty fast since the file is small.
Upon installing stack and updating the stack to its path, I download ghc. The download is extremely slow. After downloading a mere 2.40 or 1.32 MB's it becomes still and after 30 minutes or so, it shows a socket connection error. I copied the error and searched for it in Stack Overflow, but it seemed futile.
As a solution to this, I uninstalled the sole version of stack and installed the Haskell platform which came bundled with ghc and other features along with Cabal and Stack. However upon starting a project using stack, it does not detect the ghc compiler and automatically tries to download the ghc version 8.4.3. Please note that I have added ghc to the path because whenever I type ghc in command line, it gives me the Haskell terminal, and also I have checked the environment variables.
No matter what I do I cannot let stack detect the ghc already coming from Haskell platform and prevent it from automatically downloading its own version of ghc, prior to which it gets stuck at 0.66% forever.
I am from India. Is the server providing the ghc through stack have no support in my country? Or is there any way out! I seemingly cannot install any Haskell packages, for my Haskell project!
You can try adding a mirror to speed it up, take a look at TsingHua stackage mirror.
Reference:
- Haskell pattern matching - what is it?
- How to understand the <- in Haskell's do notation with an uncommon ">>=" implementation in a Monad?
- TVar that blocks read until change?
- Convert the modified cursors back to a document
- Could someone explain to me what these Iterator, Yield monad types and functions mean like I am 5?
- Haskell void function
- Is Haskell a strongly typed programming language?
- How to build lens expression dynamically?
- Why is UndecidableInstances not required here, for instance C1
- How are Dynamic Programming algorithms implemented in idiomatic Haskell?
- Type-level tuple: how to avoid nesting in a type argument
- What determines what GHC (and Cabal, and HLS, ...) version is marked as "recommended" in GHCup?
- How to zip lists with different length?
- Constant function optimization
- Is it possible to properly type hint the filterM function in Python?
- How to change the base case so it starts recursion all over?
- How laziness works with applicative functors in Haskell?
- Clean and type-safe state machine implementation in a statically typed language?
- Extracting the first Just value from [Maybe a]
- A monad is just a monoid in the category of endofunctors, what's the problem?
- How to derive instances in recursion schemes
- How do I make a do block return early?
- Ambiguous occurrence `take`
- If we bind two parsers and the second parser fails, does the string get parsed once?
- Haskell list sum generalization
- Stack run single benchmark
- How to properly step through recursive parsing?
- How do I extract this text from an xml file in Haskell
- Is it possible to generate comments to functions in Template Haskell?
- Why does GHC's type-checker accept this UndecidableInstance trick?