We present a gradually typed language, GrEff, with effects and handlers ...
We present a domain-specific type theory for constructions and proofs in...
A typical way of analyzing the time complexity of functional programs is...
A standard method for analyzing the asymptotic complexity of a program i...
The main way of analyzing the complexity of a program is that of extract...
Gradually typed languages are designed to support both dynamically typed...
We present gradual type theory, a logic and type theory for call-by-name...
We show that universes of fibrations in various models of homotopy type
...