MohamedAlaa

tmux shortcuts & cheatsheet

start new:

tmux

start new with session name:

tmux new -s myname

sigrlami

WARNING This list outdated, for the up to date version visit https://haskellcosm.com

List of companies that use Haskell in Production

Types of work:

• RD - research&development
• PR - product
• IP - in-house product
• CO - consulting

biboudis

2016

1. Sixth Summer School on Formal Techniques / 22-27 May
2. Twelfth International Summer School on Advanced Computer Architecture and Compilation for High-Performance and Embedded Systems / 10-16 July 2016
3. Oregon Programming Languages Summer School / 20 June-2 July 2016
4. The 6th Halmstad Summer School on Testing / 13-16 June, 2016
5. Second International Summer School on Behavioural Types / 27 June-1 July 2016
6. Virtual Machines Summer School 2016 / 31 May - 3 June 2016
7. ECOOP 2016 Summer School

2015

adpoe

-- Do Tree Traversals and Built a Visitation List for each

preorder :: BinaryTree a -> [a]
preorder Leaf = []
preorder (Node left root right) = root : preorder left ++ preorder right
-- NOTE: Need to use the ++ so each list gets built separately and then concatenated
-- after it hits bottom

inorder :: BinaryTree a -> [a]
inorder Leaf = []

dianjuar

Restore the GRUB Bootloader on Manjaro

1. Chroot into your linux instalation
   1. The easiest way is with mhwd-chroot
      1. Install it yaourt -S mhwd-chroot
      2. Run it sudo mhwd-chroot
      3. DONE, you have chrooted into your linux installation (open a root console of your installed linux OS, is like just open a console with root access)
2. Restore your GRUB
   1. Install a new GRUB bootloader with grub-install /dev/sda
3. Recheck to ensure the that installation has completed without any errors grub-install --recheck /dev/sda

yangshun

Easy

• https://leetcode.com/problems/basic-calculator/description/
• https://leetcode.com/problems/mini-parser/description/

Medium

• https://leetcode.com/problems/evaluate-reverse-polish-notation/description/
• https://leetcode.com/problems/ternary-expression-parser/description/
• https://leetcode.com/problems/remove-comments/description/

pokorson

Basics

mostly-adequate-guide

professor frisby egghead course

Thinking in ramda

Funfunfunction playlist

yelouafi

In this tutorial we're going to build a set of parser combinators.

What is a parser combinator?

We'll answer the above question in 2 steps.

1. What is a parser?
2. and, what is a parser combinator?

So first question: What is parser?

jdh30

(* See https://groups.google.com/forum/#!msg/fa.caml/i6IgSFX8XkY/4khF8z1V7loJ *)

type expr =
  | Int of int
  | Var of string
  | BinOp of [ `Add | `Sub | `Leq ] * expr * expr
  | If of expr * expr * expr
  | Apply of expr * expr

type defn = LetRec of string * string * expr

AndyShiue

I think I’ve figured out most parts of the cubical type theory papers; I’m going to take a shot to explain it informally in the format of Q&As. I prefer using syntax or terminologies that fit better rather than the more standard ones.

Q: What is cubical type theory?

A: It’s a type theory giving homotopy type theory its computational meaning.

Q: What is homotopy type theory then?

A: It’s traditional type theory (which refers to Martin-Löf type theory in this Q&A) augmented with higher inductive types and the univalence axiom.