Haskell   62025

« earlier    

data structures - Doubly Linked List in a Purely Functional Programming Language - Stack Overflow
In a pure functional language, a doubly-linked list is not that interesting. The idea of a doubly linked list is to be able to grab a node and go in either direction, or to be able to splice into the middle of a list. In a pure functionaly language you probably are better off with one of these two data structures:

A singly linked list with a pointer in the middle, from which you can go either left or right (a variant of Huet's "Zipper")

A finger tree, which is a mind-blowing data structure invented by Ralf Hinze and Ross Paterson.

I'm a big fan of the zipper; it's useful in a lot of situations.
fp  stack_overflow  haskell  dataStructures 
2 hours ago by dicewitch
Queensland FP Lab - Announcing sv 1.0
sv, a CSV library for Haskell by the Queensland Functional Programming Lab, was released over four months ago. Since then, we’ve had feedback on what potential users want from the library, and we have altered the design to the point where we are now releasing a new version: sv 1.0
haskell  csv  data  tooling 
13 hours ago by kmt

« earlier    

related tags

2018-08-14  75  abstract  algorithm  algorithms  arrowfunctions  blogs  book  calculus  category-theory  cats  challenge  cheatsheet  coding  comonads  compiler  compilers  computers  cool  csv  currying  data  dataframes  datastructures  dev  docker  es6  exercise  finger-trees  formal-methods  fp  free  functional  functionalprogramming  functions  ghc  haskell  hs  impl-in-hs  implementation  intro  javascript  journey  knowledge  lambda  language  learning  len  lenses  level  library  llvm  logic  london  ml  monads  ocaml  optimal  performance  philosophy  presentations  probabalistic  programming  proof  purescript  reference  scalaz  search  slack  sml  stack_overflow  standard  starting  teaching  testing  theory  tool  tooling  tools  tutorial  twitter  type  versioning  videos  vs  why_haskell  zero 

Copy this bookmark: