Using GADTs and dummy dependent-type in Haskell

Proof of Commutativity (+) in Haskell

Using GADTs and dummy dependent-type in Haskell

Haskell

Theorem Proving

Programs as Proofs I

Notes taken while reading / studying PLFA & PL generally.

Agda

Programming Languages

Final Report of Culture III and History I

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).

Japanese Studies

How to Make SPFA TLE

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.

Algorithm

Chtholly Tree

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

Data Structure

数据结构