University of Birmingham > Talks@bham > Theoretical computer science seminar > Reversible System T

  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

Reversible System T

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

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

Godel’s System T is the simply typed lambda calculus extended with numbers and an iterator. The higher-order nature of the language gives it enormous expressive power. The language can represent all the primitive recursive functions and beyond, for instance the Ackermann function is representable. In this work we use System T as a minimalistic functional language. We give a reversible interpretation using a data-flow model that incorporates ideas from the geometry of interaction and game semantics. The contribution is a reversible model of higher-order computation which can also serve as a novel, although not very practical, compilation technique.

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

Centre for Computational Biology Seminar Series Type the title of a new list here EPS - College Research and KT Support Activities

Other talks

Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Geometry of alternating projections in metric spaces with bounded curvature Modelling uncertainty in image analysis. Hodge Theory: Connecting Algebra and Analysis Quantum simulations using ultra cold ytterbium Sensing and metrology activities at NPL, India
 

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.