The λ-calculus is popular as an intermediate language for practical compilers. But in the world of logic it has a lesser-known twin, born at the same time, called the sequent calculus. Perhaps that would make for a good intermediate language, too? To explore this question we designed Sequent Core, a practically-oriented core calculus based on the sequent calculus, and used it to re-implement a substantial chunk of the Glasgow Haskell Compiler.
Mon 19 Sep
|13:40 - 14:05|
Yong Kiam TanIHPC at A*STAR, Singapore, Magnus O. MyreenChalmers University of Technology, Sweden, Ramana KumarData61 at CSIRO, Australia, Anthony FoxUniversity of Cambridge, UK, Scott OwensUniversity of Kent, UK, Michael NorrishData61 at CSIRO, AustraliaDOI
|14:05 - 14:30|
Paul DownenUniversity of Oregon, USA, Luke MaurerUniversity of Oregon, USA, Zena M. AriolaUniversity of Oregon, USA, Simon Peyton JonesMicrosoft Research, UKDOI
|14:30 - 14:55|
Liam O'ConnorUNSW, Australia, Zilin ChenUNSW, Australia, Christine RizkallahUniversity of Pennsylvania, USA, Sidney AmaniUNSW, Australia, Japheth LimData61, Australia, Toby MurrayUniversity of Melbourne, Australia, Yutaka NagashimaData61, Australia, Thomas SewellUNSW, Australia, Gerwin KleinUNSW, AustraliaDOI