17 citations · 38 across the 6 of their papers we have counts for
3 papers · 1 filter
Solver-based Gradual Type Migration
Luna Phipps-Costin, Carolyn Jane Anderson, Michael Greenberg +1
Gradually typed languages allow programmers to mix statically and dynamically typed code, enabling them to incrementally reap the benefits of static typing as they add type annotat…
Injecting Finiteness to Prove Completeness for Finite Linear Temporal Logic
Eric Campbell, Michael Greenberg
Temporal logics over finite traces are not the same as temporal logics over potentially infinite traces. Roşu first proved completeness for linear temporal logic on finite traces (…
How to Safely Use Extensionality in Liquid Haskell
Niki Vazou, Michael Greenberg
Refinement type checkers are a powerful way to reason about functional programs. For example, one can prove properties of a slow, specification implementation, porting the proofs t…