![]() |
![]() |
The next 700 abstract machinesAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Dr Steve Vickers. We propose a new core calculus for programming languages with effects, interpreted using a hypergraph-rewriting abstract machine inspired by the Geometry of Interaction. The intrinsic calculus syntax and semantics only deals with the basic structural aspects of programming languages: variable binding, name binding, and thunking. Everything else, including function abstraction and application, must be provided as extrinsic operations with associated rewrite rules. The graph representation yields natural concepts of locality and robustness for equational properties and reduction rules, which enable a novel flexible and powerful reasoning methodology about (type-free) languages with effects. We illustrate and motivate the technique with challenging examples from the literature. Joint work with Koko Muroya and Todd Waugh Ambridge. This talk is part of the Lab Lunch series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsCold atoms computer sience SERENE Group Seminar SeriesOther talksQuantum simulations using ultra cold ytterbium Ultrafast, all-optical, and highly efficient imaging of molecular chirality Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Sensing and metrology activities at NPL, India Perfect matchings in random sparsifications of Dirac hypergraphs Modelling uncertainty in image analysis. |