Haskell¶

Изучение¶

Денис Москвин. Функциональное программирование на языке Haskell. stepik.org, видеокурс

Часть 1.
Часть 2.

О Haskell по-человечески
Learn You a Haskell for Great Good!
Real World Haskell by Bryan O'Sullivan, Don Stewart, and John Goerzen

ru.haskell— сообщество русскоговорящих Haskell-разработчиков

Полезные ссылки

ru.haskell wiki

Настройка редакторов для поддержки Haskell

Haskell Cheatsheet
haskell-trainings
Stack cookbook

snippets¶

• HaskellMaybeChecks
• HaskellTypeLevelMachine

ghci debugging¶

:set -fbreak-on-error -fbreak-on-exception
:trace machineMain
:force _exception
:hist
:back

libs¶

• co-log
• named arguments
• binary-parsers
• concat (z3cat || smt example) — Compiling to categories — compiler plugin for translating normal Haskell functions (on standard types) to SMT, etc.
• SBV: SMT Based Verification — translates Haskell functions on custom symbolic types
• refined — refinement types

  type ProperFraction = Refined (And (Not (LessThan 0)) (Not (GreaterThan 1))) Double

• hedgehog — random test gen (QuickCheck)
• dejafu — concurrency testing
• GHC.Stack — can get code position for DSL
• Data.Sequence — list with fast append on both sides

exts¶

• Existential Quantification
• RebindableSyntax — overloading built-in operators / do notation
• NullaryTypeClasses — global implementation of one thing
• DataKinds , TypeFamilies (+ GHC.TypeLits) — type-level annotations
  • Basic Type Level Programming in Haskell
  • Parsing type-level strings in Haskell
  • Servant, Type Families, and Type-level Everything
  • Haskell Type Names as Strings

other¶

• ST Monad for imperative algorithms
• A Rosetta Stone for Haskell Abstractions Applicative, StateT, Lens
• Is it possible to place inequality constraints on haskell type variables?
• Associated Types and Haskell
• Practical uses of the Tardis monad?: 'build a packet ... where the fixed-length lengths and offsets of some variable length data are sent out before the actual data themselves'
• Comonadic builders
• Typed final (aka, ``tagless-final'') style is a general method of embedding domain-specific languages (DSL)
• Control.Monad.Trans.Cont / CC-delcont / Delimited continuations in Haskell / A Monadic Framework for DelimitedContinuations
• https://github.com/quchen/articles/blob/master/cont_monad.md
• https://github.com/cohomolo-gy/haskell-resources
• https://reasonablypolymorphic.com/blog/specialization/
• https://github.com/ghc-proposals/ghc-proposals/pull/52
• ftp://ftp-sop.inria.fr/indes/TFP15/TFP2015_submission_19.pdf
• https://free.cofree.io/2019/01/08/defunctionalization/
• https://blog.poisson.chat/posts/2018-08-06-one-type-family.html
• https://gist.github.com/Icelandjack/5afdaa32f41adf3204ef9025d9da2a70
• https://ryanglscott.github.io/2019/05/26/on-the-arity-of-type-families/ https://www.microsoft.com/en-us/research/uploads/prod/2019/03/ho-haskell-5c8bb4918a4de.pdf
• http://conal.net/blog/posts/overloading-lambda