University of Cambridge > > Semantics Lunch (Computer Laboratory) > Higher order reactive programming

Higher order reactive programming

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Sam Staton.

In this talk, I describe a denotational model of higher-order functional reactive programming using ultrametric spaces, which provide a natural Cartesian closed generalization of causal stream functions. I’ll then describe how reactive programs written in this language can be implemented efficiently using an imperatively updated dataflow graph, whose correctness proof uses ideas from rely-guarantee, step-indexed models, and separation logic.

This talk is part of the Semantics Lunch (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity