University of Cambridge > > Logic and Semantics Seminar (Computer Laboratory) > Extensional rewriting with sums

Extensional rewriting with sums

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

If you have a question about this talk, please contact Sam Staton.

Inspired by recent work on normalisation by evaluation for sums, we propose a normalising and confluent extensional rewriting theory for the simply-typed lambda-calculus extended with sum types. As a corollary of confluence we obtain decidability for the extensional equational theory of simply-typed lambda-calculus extended with sum types. Unlike previous decidability results, which rely on advanced rewriting techniques or advanced category theory, we only use standard techniques.

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-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity