Difference between revisions of "User:MathematicalOrchid"
Jump to navigation
Jump to search
Line 30: | Line 30: | ||
* How do you do graphics in Haskell? |
* How do you do graphics in Haskell? |
||
* Why does Hugs crash so much? |
* Why does Hugs crash so much? |
||
− | * How come (e.g.) Smalltalk provides 27 different types of collection, but |
+ | * How come (e.g.) Smalltalk provides 27 different types of collection, but Haskell only ever involves single-linked lists and binary trees? |
* Is <hask>putStr xs1; putStr xs2</hask> faster or slower than <hask>putStr (xs1 ++ xs2)</hask>? |
* Is <hask>putStr xs1; putStr xs2</hask> faster or slower than <hask>putStr (xs1 ++ xs2)</hask>? |
Revision as of 10:56, 29 January 2007
Status: Enthusiastic Haskell newbie.
Main Interests:
- Using Haskell to write triposcopic mathematical algorithms in tiny amounts of code.
- Using Haskell to do seriously compute-bounded work in a multiprocessor setup.
Current Projects:
- Haskell to Java compiler.
- Interactive Haskell step-line debugger.
- Program to convert my custom markup to HTML and LaTeX.
Projects On Hold:
- Sorting algorithm benchmarks.
- Audio DSP in Haskell.
- Haskell implementation of compression algorithms.
- Haskell DSL for POV-Ray.
Failed Projects:
- Haskell fractal generator.
- Haskell ray tracer.
- Haskell program to cause world peace.
Current Unsolved Questions:
- Why do Haskell extensions exist?
- How do you do graphics in Haskell?
- Why does Hugs crash so much?
- How come (e.g.) Smalltalk provides 27 different types of collection, but Haskell only ever involves single-linked lists and binary trees?
- Is
putStr xs1; putStr xs2
faster or slower thanputStr (xs1 ++ xs2)
?