P.Di Gianantonio, G.Franco, F.Honsell. Game Semantics for Untyped #-calculus, TLCA'99 Conf. Proc., LNCS, 1999. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Fully Complete Models for ML Polymorphic Types - Abramsky, Lenisa (1999) (Correct)
....are represented by partial involutions from Opponent moves to Player moves, should provide fully complete models for simply typed # calculus with #, # base constants. In the untyped setting, partial involutions strategies could possibly provide fully abstract models , alternative to those in [DFH99, KNO99]. In the category PER PInv , models of typed Bohm trees naturally arise (e.g. the model induced by the Sierpinski PER in Section 5.2) These are in particular models of the simply typed # calculus together with a fixed point combinator, as suggested by Alex Simpson. All these infinite ....
P.Di Gianantonio, G.Franco, F.Honsell. Game Semantics for Untyped #-calculus, TLCA'99 Conf. Proc., LNCS, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC