Using GADTs and dummy dependent-type in Haskell

Programs as Proofs continued

Notes taken while reading / studying PLFA & PL generally.

My final paper of Culture III and History I took @ Waseda Summer Session 2019. Culture III is Japanese Popular Culture and Globalization and History I is Heisei History (see https://ad1024.space/about).

Music pieces I listened to recently...

SPFA: Using a queue to optimize Bellman-Ford Algorithm. The time complexity is $O(k|E|)$, where k is a small constant related to how many times a node is pushed into the queue more than once.

Chtholly Tree is an optimized brute force approach to maintain sequence of numbers.

An Interesting problem given by my Math 125 TA.

DP Problem Collection for RSO Event.

Collaborative essay for GWSS 328. Composed with with Mai Nguyen.