University of Birmingham > Talks@bham > Lab Lunch > From game semantics to delay-insensitive circuits

  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

From game semantics to delay-insensitive circuits

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

If you have a question about this talk, please contact Dan Ghica.

This work extends previous work on the compilation of higher-order imperative languages into digital circuit. We introduce concurrency, an essential feature in the context of hardware compilation and we re-use an existing game model to simplify correctness proofs. The target designs we compile to are asynchronous event-logic circuits, which naturally match the asynchronous game model of the language.

To appear at MFPS XXVI .

This talk is part of the Lab Lunch series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Centre for Systems Biology Coffee Mornings Postgraduate Seminars in the School of Computer Science Topology and Dynamics seminar

Other talks

Test talk Extending the Lax type operator for finite W-algebras Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Geometry of alternating projections in metric spaces with bounded curvature Ultrafast, all-optical, and highly efficient imaging of molecular chirality 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.