Juan Chen and Nikhil Swamy: FINE, Functional Programming for End-to-End Security Verification

Sign in to queue

The Discussion

  • User profile image

    Sounds interesting -- will watch later ...

  • User profile image
    Tom Lokhorst



    The type of fread looks a bit like a dependent type. Since the third type depends on the value of the first argument. Although, since u is only used in the predicate part of the "type", that might not be true.


    Is FINE depedently typed?

  • User profile image

    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. 

Add Your 2 Cents