P. Di Gianantonio. Game semantics for the Pure Lazy Lambda Calculus. In Proc. 5th Int. Conf. Typed Lambda Calculi and Applications, Krakow, Poland, May 2001, pages 106-120. Springer-Verlag, 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Games Characterizing Levy-Longo Trees - abstract, bibliography, summary.. Self-citation (Di gianantonio) (Correct)
....trees i.e. every strategy is the denotation of a unique Levy Longo tree. To our knowledge, this is the rst universal model of Levy Longo trees. The observational quotient of the model then gives a fully abstract and universal model of the (pure) Lazy Lambda Calculus [12, 3] Related work. In [5] a game model in the style of AJM [1] is constructed which gives rise to the rst fully abstract model of the Lazy Lambda Calculus. The strategies considered therein are history free and satisfy a condition of monotonicity ; see also [2] In [9, 8] game models based on almost everywhere copycat ....
....Take any set M that is equipped with a function : M f Q; A g that labels elements as either questions or answers. Let s be a nite sequence of elements from M call s a dialogue. Set # qn (s) and # ans (s) respectively to be the number of questions and the number of answers in s. Following [5], we de ne the nested level at s m (or simply the level of m whenever s is understood) to be NL(s m) 1 if m is a question if m is an answer where = # qn (s m) # ans (s m) we de ne NL( 0. For example, the nested levels of the moves in the dialogue [ ....
P. Di Gianantonio. Game semantics for the Pure Lazy Lambda Calculus. In Proc. 5th Int. Conf. Typed Lambda Calculi and Applications, Krakow, Poland, May 2001, pages 106-120. Springer-Verlag, 2001.
Games Characterizing Levy-Longo Trees - Ong, Di Gianantonio Self-citation (Di gianantonio) (Correct)
....and Conditional Copycat and Relevance, which are constraints on strategies. Since Persistence constrains Opponent as well as Player, the model presented here is not simply a submodel of McCusker s. An AJM style game model of the the pure Lazy Lambda Calculus was presented by the second author in [6]. The strategies therein are history free and satisfy a monotonicity condition. Though fully abstract for the language, the model is not universal (there are nite monotone strategies that are not denotable) However we believe it is possible to achieve universality by introducing a condition ....
....Take any set M that is equipped with a function : M f Q; A g which labels elements as either questions or answers. Let s be a nite sequence of elements from M call s a dialogue. Set # qn (s) and # ans (s) respectively to be the number of questions and the number of answers in s. Following [6], we de ne the nested level at s m (or simply the level of m whenever s is understood) to be NL(s m) 1 if m is a question if m is an answer where = # qn (s m) # ans (s m) we de ne NL( 0. For example, the nested levels of the moves in the dialogue [ ....
P. Di Gianantonio. Game semantics for the Pure Lazy Lambda Calculus. In Proc. TLCA 2001, pages 106-120. Springer-Verlag, 2001.
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