5 ms·

>doubts about it's ultimate suitability for iterate-quickly, fail-fast software world. Lest you doubt: http://thesz.mskhug.ru/svn/hiersort/doc/hhm-eng.pdf http

by thesz 15y ago

>doubts about it's ultimate suitability for iterate-quickly, fail-fast software world. Lest you doubt: http://thesz.mskhug.ru/svn/hiersort/doc/hhm-eng.pdf http://thesz.mskhug.ru/svn/hiersort/doc/hhm-eng.pdf We did a cycle-accurate prototype of MIPS CPU with some twists. In Haskell. For Haskell to shine in prototyping you have to apply it to some critical and new task, where type system works with you, preventing errors. The novelty is crucial, I think. You will have to explore the solution space with the help of some sort of theorem prover (type system).

ThaddeusQuay2 15y ago
"You will have to explore the solution space with the help of some sort of theorem prover (type system)." Have you tried ATS (Applied Type System)? http://en.wikipedia.org/wiki/ATS_(programming_language) http://en.wikipedia.org/wiki/ATS_(programming_language)
- thesz 15y ago
  No, I haven't. When I looked at it, I didn't see a well-composed thing like Epigram or Agda2. So I decided to stick to Haskell for a while and then slowly work my way to Agda2, if I would feel the need.