Tags¶
abstract-refinements¶
- A Finer Filter
- Abstracting Over Refinements
- Putting Things In Order
- Splitting and Splicing Intervals (Part 1)
- Splitting and Splicing Intervals (Part 2)
advanced¶
announcement¶
basic¶
- Arithmetic Overflows
- Bounding Vectors
- Bounding Vectors
- KMeans Clustering I
- KMeans Clustering II
- Liquid Types vs. Floyd-Hoare Logic
- LiquidHaskell is a GHC Plugin
- Polymorphic Perplexion
- Refinement Types 101
- Refinements 101 (contd.)
- Talking About Sets
- The Advantage of Measures
- Unique Zippers
benchmarks¶
induction¶
measures¶
- CSV Tables
- KMeans Clustering I
- KMeans Clustering II
- Measures and Case Splitting
- Normal Forms
- Okasaki's Lazy Queues
- Refinement Reflection on ADTs
- Safely Catching A List By Its Tail
- Talking About Sets
- The Advantage of Measures
- Unique Zippers
reflection¶
- Haskell as a Theorem Prover
- Refinement Reflection on ADTs
- Splitting and Splicing Intervals (Part 1)
- Splitting and Splicing Intervals (Part 2)
- The Hillelogram Verifier Rodeo I (LeftPad)
sets¶
termination¶
- Checking Termination
- Getting To the Bottom
- LiquidHaskell Caught Telling Lies!
- Termination Requires Refinements