What do Haskellers think about Rust?

• confcheck

  1 2 5.3 Haskell

I am sure this had nothing to do with the Rust language itself. Perhaps 3 years ago I looked for XML libraries to rewrite confcheck in Rust. I tried 4 libraries and they were all horribly slow, and inconvenient to use. Perhaps, there are better libraries now?

• confcheck-types

  1 1 3.2 Haskell

  confcheck-types

In Haskell I could use a fast streaming library, and build a parser on top of it like that. It's a bit disgusting, but it's fast and kind of convenient :)

• InfluxDB

  www.influxdata.com sponsored

  Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

  

• sixten

  5 748 1.8 Haskell

  Functional programming with fewer indirections

Immutable data structures don't necessarily require more memory: they can avoid deep copies. They are also automatically thread safe without expensive (slow) locking mechanisms. They also don't necessarily reduce cache locality. The reduced cache locality in the case of Haskell (I think) mainly comes from the representation of objects in its implementation (improved STG) which uses extensive boxing and jumps that hinder both spatial and temporal locality (require review/comment from GHC/Computer Architecture experts, take it with a grain of salt). Objects can be much more efficiently represented if not for the need to implement lazy (call-by-need) semantics. See sixten and futhark for examples.

• futhark

  52 2,293 9.8 Haskell

  :boom::computer::boom: A data-parallel functional programming language

  

Immutable data structures don't necessarily require more memory: they can avoid deep copies. They are also automatically thread safe without expensive (slow) locking mechanisms. They also don't necessarily reduce cache locality. The reduced cache locality in the case of Haskell (I think) mainly comes from the representation of objects in its implementation (improved STG) which uses extensive boxing and jumps that hinder both spatial and temporal locality (require review/comment from GHC/Computer Architecture experts, take it with a grain of salt). Objects can be much more efficiently represented if not for the need to implement lazy (call-by-need) semantics. See sixten and futhark for examples.

Suggest a related project