A. Jung and J. Tiuryn. A new characterization of lambda de nability. In M. Bezem and J. F. Groote, editors, Typed Lambda Calculi and Applications, volume 664 of Lecture Notes in Computer Science, pages 245-257. Springer Verlag, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On a Semantic Definition of Data Independence - Lazic, Nowak (2003) (Correct)
....Symbolic LTSs are a basic formalism which combines simply typed calculus and nondeterminism. They can be seen as a graphical variant of UNITY, and are a generalisation of rst order Kripke structures [2] Compared with the literature on de nability in models based on logical relations (e.g. [17, 13, 1, 7]) we consider only rst order computation which can use equality testing and predicates of arbitrary arity, but the novelty in our result is that it applies to nondeterministic computation. Section 2 is devoted to preliminaries. In Section 3, we de ne families of values, sets, and LTSs, and ....
A. Jung and J. Tiuryn. A new characterization of lambda de nability. In Proceedings of the 1st International Conference on Typed Lambda Calculi and Applications (TLCA'93), volume 664 of Lecture Notes in Computer Science, pages 245-257. Springer-Verlag, 1993.
On a Semantic Definition of Data Independence - Lazic, Nowak (2002) (Correct)
....Symbolic LTSs are a basic formalism which combines simply typed calculus and nondeterminism. They can be seen as a graphical variant of UNITY, and are a generalisation of rst order Kripke structures [2] Compared with the literature on de nability in models based on logical relations (e.g. [18, 13, 1, 7]) we consider only rst order computation which can use equality testing and predicates of arbitrary arity, but the novelty in our result is that it applies to nondeterministic computation. Section 2 is devoted to preliminaries. In Section 3, we de ne families of values, sets, and LTSs, and ....
A. Jung and J. Tiuryn. A new characterization of lambda de nability. In Proceedings of the 1st International Conference on Typed Lambda Calculi and Applications (TLCA'93), volume 664 of Lecture Notes in Computer Science, pages 245-257. Springer-Verlag, 1993.
Logical Relations for Monadic Types - Goubault-Larrecq, Lasota, Nowak (2002) (Correct)
....and probabilistic systems. Keywords: logical relations, monads, semantics, typed lambda calculus. 1 Introduction Motivation and context. Logical relations and their generalizations [13] are a fundamental tool in proving properties of lambda calculi, e.g. characterizing lambda de nability [19, 9, 2, 4], proving equational completeness [13, 24] studying parametric polymorphism [21, 12, 11] notably. On the other hand, Moggi s computational lambda calculus [16] has proved useful to de ne various notions of computations on top of the lambda calculus: side e ects, input output, continuations, ....
A. Jung and J. Tiuryn. A new characterization of lambda de nability. In TLCA'93, pages 245-257. Springer Verlag LNCS 664, 1993.
Parametricity as a Notion of Uniformity in Reflexive Graphs - Dunphy (2002) Self-citation (Jung) (Correct)
....X implementing queues (called a concrete implementation) along with implementations for the basic operations. Various good semantic models for parametrically polymorphic languages have been produced using families of functions which seem uniform to interpret parametrically polymorphic functions [JT93, OR94, OT95] An abstract characterization of uniform families applicable to a wide range of settings beyond that of sets and functions would be useful in producing semantic models for more polymorphic langauages. A characterization of uniform families can be used to characterize the information ....
A. Jung and J. Tiuryn. A new characterization of lambda de nability. In M. Bezem and J. F. Groote, editors, Typed Lambda Calculi and Applications, volume 664 of Lecture Notes in Computer Science, pages 245-257. Springer Verlag, 1993.
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