## Reversible System TAdd to your list(s) Download to your calendar using vCal - Ian Mackie (University of Sussex)
- Friday 13 January 2017, 11:00-12:00
- Computer Science, The Sloman Lounge (UG).
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. ## This talk is included in these lists:- Computer Science Departmental Series
- Computer Science Distinguished Seminars
- Computer Science, The Sloman Lounge (UG)
- Theoretical computer science seminar
- computer sience
Note that ex-directory lists are not shown. |
## Other listsCentre for Computational Biology Seminar Series Type the title of a new list here EPS - College Research and KT Support Activities## Other talksProvably 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 |