Code accompanying a forthcoming paper of Yu-Han Lyu, Akimasa Morihata, and me: Constructing Datatype-Generic Fully Polynomial-Time Approximation Schemes Using Generalised Thinning.
Research
Agda Approximation Bidirectional Updating Burrows-Wheeler Transform Concurrency Converse-of-a-Function Theorem Curry-Howard Data Structure Dependent Type Fibonacci GADT Galois Connection Greedy Theorem Haskell HaXML Imperative Programs Indirect Equality List Homomorphism Logic Logic Programming Optimisation Problems Program Derivation Program Inversion Quantum Programming Quine Regular Expression Segment Problems Termination Thinning Theorem Types XML Streaming λ calculusRecent Comments
- Matt on A Survey of Binary Search
- Shin on The Maximum Segment Sum Problem: Its Origin, and a Derivation
- Shin on The Maximum Segment Sum Problem: Its Origin, and a Derivation
- minime on Beamer Article Mode Does Not Save Paper?
- wren ng thornton on Proving the Church-Rosser Theorem Using a Locally Nameless Representation