This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
We present a game model for classical PCF, a nite version of PCF extended by a catch/throw mechanism. This model is build from E-dialogues, a kind of two-players game de ned by Lor...