With the Granule project, we are working towards making statically typed functional languages more resource-aware, hence providing a way to enforce stateful protocols regarding memory, file handles, network interaction, etc. Static enforcement of security policies and first-class support for multi-stage programming are further examples of what is possible in a type system based on Linear Logic and Graded Modalities. We present Granule, a functional programming language which combines parametric polymorphism and indexed types with such a type system. Granule programs will probably look very familiar to you, especially if you know some Haskell/ML, but in Granule’s type system we can reason about much more. Hillel Wayne’s Great Theorem Prover Showdown has made a point of the fact that there are many things we can’t easily reason about with functional (programming proving)—up until now!
![Vilem liepelt kent england Vilem liepelt kent england](https://www.adjoint.io/files/logos/adjoint-logo-600x315.png)
We will implement leftPad in Granule and prove it correct with little more effort that writing the type signatures. We will then breeze through how Granule’s type system very naturally supports session-typed channels and safe mutable arrays. Material.Slides:. Event.Typelevel Summit Lausanne, June 2019:. About Speaker.I believe in static types & thoughtfully crafted APIs, good communication & documentation, and open-mindedness & fearless prototyping. Licensing.This recording is licensed under CC-BY 4.0.
Washington and Lee Law Review Volume 38 Issue 4 Article 17 Fall 9-1-1981 Index Pt. 3 Follow this and additional works at:https://scholarlycommons.law.wlu.edu/wlulr.