3 ms·

Haskell

• chongli 13y ago
  There's actually been a bit of work on this very idea! http://programatica.cs.pdx.edu/House/ http://programatica.cs.pdx.edu/House/
  • agumonkey 13y ago
    funny sidenote, one of House dev (Jeremey Bobbio) had a talk at FOSDEM2014 about reproducible builds for debian, similar to Nix (also immutable in spirit) I believe. https://fosdem.org/2014/schedule/event/reproducibledebian/ https://fosdem.org/2014/schedule/event/reproducibledebian/
• dons 13y ago
  - HaLVM : https://github.com/GaloisInc/HaLVM https://github.com/GaloisInc/HaLVM - House: http://programatica.cs.pdx.edu/House/ http://programatica.cs.pdx.edu/House/ - SeL4 : http://ssrg.nicta.com.au/projects/seL4/ http://ssrg.nicta.com.au/projects/seL4/ Emphasis is on the security and verifiability typed, pure-by-default Haskell provides, over OS design.
• yvdriess 13y ago
  The current Haskell execution engine is very imperative indeed. Instead of graph reduction, you could drive your execution in a completely immutable way by using string reduction. I don't think this has been explored much, I only found mention of it in 80s FP books (and Dybvig's thesis).