Hey! Welcome to the Functional Programming group. First of all,

Question

Hey! Welcome to the Functional Programming group. First of all,

please read the rules:
@thedevsrules

Do you want to learn Functional Programming and make the world a safer place? Start here:

Programming Languages:
- Haskell: https://www.haskell.org
- OCaml: https://ocaml.org
- Standard ML: https://www.smlnj.org
- Scala: https://www.scala-lang.org
- F#: https://fsharp.org
- Clojure: https://clojure.org
- Schema: https://schema.org
- Racket: https://racket-lang.org
- Erlang: https://www.erlang.org
- PureScript: https://www.purescript.org
- SWI Prolog: https://www.swi-prolog.org
- Elixir: https://elixir-lang.org
- Common Lisp: https://common-lisp.net
- Miranda: http://miranda.org.uk/
- Clean: https://en.m.wikipedia.org/wiki/Clean_(programming_language)

Proof Assistants:
- Isabelle: https://isabelle.in.tum.de
- Coq: https://isabelle.in.tum.de

Dependantly Typed Programming Languages:
- Idris: https://www.idris-lang.org
- Agda: https://github.com/agda/agda
- F*: https://www.fstar-lang.org
- Epigram: http://www.e-pig.org/

Definitions:
- Lambda Calculus
(λ-calculus): A system of mathematics to calculate via lambda expressions.
- Lambda Expression: A first class anonymous function.
- Pure: Always preserving the previous version and maintaining its original, immutable state.
- Propositional Logic: https://en.m.wikipedia.org/wiki/Propositional_calculus
- Functional Programming Jargon (JavaScript): https://github.com/hemanth/functional-programming-jargon
- Functional Glossary (Haskell): https://degoes.net/articles/fp-glossary
- What To Know Before Debating Type Systems: http://blog.steveklabnik.com/posts/2010-07-17-what-to-know-before-debating-type-systems
- The Curry's Paradox in brief and explanation for type systems: https://math.stackexchange.com/questions/1602611/wikipedias-explanation-of-the-lambda-calclulus-form-of-currys-paradox-makes-no
- Cartesian Closed Category: https://en.m.wikipedia.org/wiki/Cartesian_closed_category
- Combinatory Logic: https://en.m.wikipedia.org/wiki/Combinatory_logic
- Type Theory: https://en.m.wikipedia.org/wiki/Type_theory
- HoTT: https://en.m.wikipedia.org/wiki/Homotopy_type_theory
- Category Theory: https://en.m.wikipedia.org/wiki/Category_theory
- ADTs: https://engineering.shopify.com/blogs/engineering/understanding-programs-using-graphs
- GADTs: https://en.m.wikipedia.org/wiki/Generalized_algebraic_data_type
- Pi Calculus (π-calculus): https://en.m.wikipedia.org/wiki/%CE%A0-calculus
- Homotopy Type Theory: https://hottheory.files.wordpress.com/2012/08/hott2.pdf

Reproducible Package Managers:
- Guix: https://guix.gnu.org/
- Nix: https://nixos.org/

Category Theory:
- CT for programmers: https://bartoszmilewski.com/2014/10/28/category-theory-for-programmers-the-preface/
- CT resources: https://github.com/prathyvsh/category-theory-resources
- "What is applied category theory?": https://arxiv.org/abs/1809.05923

Awesome Lists:
- Haskell Mentors List: https://github.com/willbasky/Awesome-list-of-Haskell-mentors

Tutorials:
- Haskell: https://sras.me/haskell/miscellaneous-enlightenments.html
- Profunctor Optics: https://github.com/hablapps/DontFearTheProfunctorOptics
- HoTT: https://github.com/EgbertRijke/HoTT-Intro
- Lean Interactive Game: https://wwwf.imperial.ac.uk/~buzzard/xena/natural_number_game/

Articles/Books:
- Functorio, a game to learn FP: https://bartoszmilewski.com/2021/02/16/functorio/
- Mostly Adequate FP: https://mostly-adequate.gitbook.io/mostly-adequate-guide/
- Crafting Interpreters: https://craftinginterpreters.com/

#pin #pinned #post