Yes, Fine is dependently typed. In fact, we have dependent refinements: types like {x:t | phi}, where the formula phi is a type that can contain values from the term language. We also have value indexed types like cred < u > in the example of fread from the video, where u is a value. And, we also have affine types which allow us to model stateful programs. Incidentally, we chose the name "Fine" in part because of the afFINE and reFINEment typing constructs. 

 

Check out our papers at research.microsoft.com/fine for more details.