Live proof-by-induction

Boris G Shingarov

Keywords: smalltalk, proof theory, inductive proof, refinement type

TL;DR: Refinement types implemented in Smalltalk

Abstract:

Refinement types are a powerful formalism with many applications in program verification, compiler optimization, etc.
We present our work-in-progress on MachineArithmetic, an implementation of refinement types in Smalltalk. Our current results are empirical, successfully running tests in the LiquidHaskell benchmark suite.