A lightweight approach to start time consistency in Haskell

Wolfgang Jeltsch

Institute of Cybernetics at TUT

Thursday, 9 February 2012, 14:00
Cybernetica Bldg (Akadeemia tee 21), room B101

Slides from the talk [pdf]

Abstract: Functional Reactive Programming (FRP) is about computing with temporal processes. Such processes usually have fixed start times. Operations on processes impose start time constraints. This talk presents a technique to statically enforce such constraints in Haskell. Our solution is lightweight in three ways: it is simple to implement, it does not cause much overhead to the user, and it works with standard Haskell 2010.

Tarmo Uustalu
Last update 10.2.2012