University of Birmingham > Talks@bham > Theoretical computer science seminar > A Curry-Howard Correspondence for Event-Based Programming

  Browse A-Z

Log in

System Admin (disabled)details Birmingham usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

A Curry-Howard Correspondence for Event-Based Programming

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

If you have a question about this talk, please contact Paul Taylor.

Event-driven programming is based on a natural abstraction: an event is a computation that can eventually return a value. This talk shows how to exploit the intuition relating events and time by drawing a Curry- Howard correspondence between a functional event-driven programming language and a linear-time temporal logic. In this logic, the eventually proposition ◇A describes the type of events, and Girard’s linear logic describes the effectful and concurrent nature of the programs.

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Type the title of a new list here BritGrav 15 Facts and Snacks

Other talks

Geometry of alternating projections in metric spaces with bounded curvature Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems TBC Modelling uncertainty in image analysis. Disorder relevance for non-convex random gradient Gibbs measures in d=2 Quantum simulations using ultra cold ytterbium
 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.