Continuing the discussion from Pre-Pre-HFTP: Decoupling base and GHC:
One cool thing I remember from reading Agda code is that the stdlib defines things like Bool and List and tells the compiler “here is your definition of list” with a pragma. Porting the idea to Haskell would mean that GHC would be able to indirectly depend on the list in base
rather than the other way around.
- Is there anything fundamental about the difference between Agda and Haskell that invalidates the comparison?
- Is this just a lot of work?
- Is this the kind of thing Backpack enables?
- Is GHC in principle able to use backpack like this?