University of Cambridge > > Logic and Semantics Seminar (Computer Laboratory) > Local reasoning for robust observational equivalence

Local reasoning for robust observational equivalence

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

  • UserKoko Muroya
  • ClockThursday 12 September 2019, 13:45-14:45
  • HouseFW26.

If you have a question about this talk, please contact Jean Pichon-Pharabod.

Note the unusual time and day. 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 deal with the basic structural aspects of programming languages: variable binding, name binding, and thunking. Everything else, including features which are commonly thought of as intrinsic, such as arithmetic or 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. (This is joint work with Dan R. Ghica and Todd Waugh Ambridge.)

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity