Ghilezan, S., Strong normalization and typability with intersection types, Notre Dame Journal of Formal Logic 37 (1996), pp. 44--52. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Cut-Elimination in the Strict Intersection Type Assignment.. - van Bakel (Correct)
....use the technique of Computability Predicates [24, 18] which provides a means for proving termination of typeable terms using a predicate defined by induction on the structure of types. This technique has been widely used to study normalisation properties (or similar results) as for example in [20, 12, 15, 22, 19, 1, 2, 17, 7, 4, 16, 5] (this list is by no means intended to be complete) Also, as in [2] the technique proved to be sufficient to show a head normalisation and an approximation result as well as head normalisation and approximation results (see Thm. 27) This papers considers intersection types, also because, using ....
S. Ghilezan. Strong normalization and typability with intersection types. Notre Dame Journal of Formal Logic, 37(1):44--52, 1996.
Compositional Characterisations of λ-terms.. -.. (2003) (Correct)
....characterisations in terms of intersection type disciplines. The most significant case is that of strongly normalising terms. One of the original motivations for introducing intersection types in [25] was precisely that of achieving such a characterisation. Alternative characterisations appear in [21,4,20,17,3,18]. In [11] both normalising and persistently normalising terms had been characterised using intersection types. The type assignment system in [11] has also been discussed in [8] Closed terms were characterised in [19] The characterisations appearing in Theorem 3.2 strengthen and generalise all ....
S. Ghilezan. Strong normalization and typability with intersection types. Notre Dame J. Formal Logic, 37(1):44--52, 1996.
Characterising Strong Normalisation for Explicit.. - van Bakel.. (2002) (Correct)
.... originated in [7] to overcome the limitations of Curry s type assignment system and to provide a characterisation of strongly normalising terms of the calculus [20] Since then, intersection type disciplines were used in a series of papers for characterising evaluation properties of terms [16, 15, 3, 4, 12, 2, 11, 9]. We are interested here in considering calculi of explicit substitutions, originated in [1] for improving implementation of the calculus. Actually, in the literature there are many different proposals of explicit substitution calculi [6, 5, 14, 21] These calculi are surely powerful tools for ....
S. Ghilezan. Strong normalization and typability with intersection types. Notre Dame J. Formal Logic, 37(1):44--52, 1996.
Compositional Characterizations of λ-terms.. -.. (2000) (Correct)
....a characterization in terms of intersection type disciplines. The most significant case is that of strongly normalizing terms. One of the original motivations for introducing intersection types in [21] was precisely that of achieving such a characterization. Alternative characterizations appear in [18, 5, 17, 14, 4, 15]. In [10] both normalizing and persistently normalizing terms had been characterized using intersection types. Closed terms were characterized in [16] The characterizations appearing in Theorem 1 strengthen and generalize all earlier results, since all mentioned papers consider only specific type ....
S. Ghilezan. Strong normalization and typability with intersection types. Notre Dame J. Formal Logic, 37(1):44--52, 1996.
Beta-Reduction As Unification - Kfoury (1996) (8 citations) (Correct)
....iff, by Theorem 7.13, Gamma(M ) has a solution. Corollary 7.15 For every well named M 2 , M is fi SN iff M is typable in the system ; Proof: Immediate from Theorem 3.7 and Corollary 7.14. Variations of the equivalence in Corollary 7. 15 are well known in the literature (see [2], 3] and the references cited therein) these are variations because they use formulations of the system of intersection types that are somewhat different from our ; One particular feature of the proof of 7.15 here is that it does not use an argument based on the method of candidats de ....
Ghilezan, S., "Strong Normalization and Typability with Intersection Types", Notre Dame J. Formal Logic, Vol 37, no. 1, Winter 1996.
A Linearization of the Lambda-Calculus and Consequences - Kfoury (1996) (Correct)
.... fi reduction t from N can be uniquely projected to a fi reduction u from M , by Proposition 3.10. N 0 is the last list in both t and u. Hence, as M is fi reduced to the fi nf N 0 , M is fi normalizing and, by Theorem 3.6, M is fi SN. A well known result in the literature (e.g. see [4], 5] 7] 8] 9] 12] 13] and the references cited therein) with several different proofs, is that a standard term M is fi SN iff M is typable in the system of intersection types (without top ) Corollary 4.6 is one more different proof for this result; actually, it is a variation of ....
Ghilezan, S., "Strong Normalization and Typability with Intersection Types", Notre Dame J. Formal Logic, Vol 37, no. 1, Winter 1996.
Reducibility: a ubiquitous method in lambda calculus with.. - Ghilezan, al. (2002) Self-citation (Ghilezan) (Correct)
No context found.
Ghilezan, S., Strong normalization and typability with intersection types, Notre Dame Journal of Formal Logic 37 (1996), pp. 44--52.
A Lambda Model Characterizing Computational Behaviours of.. - Dezani-Ciancaglini.. Self-citation (Ghilezan) (Correct)
No context found.
Silvia Ghilezan. Strong normalization and typability with intersection types. Notre Dame J. Formal Logic, 37(1):44--52, 1996.
Behavioural Inverse Limit λ-Models - Dezani-Ciancaglini, Ghilezan.. (2003) Self-citation (Ghilezan) (Correct)
No context found.
S. Ghilezan. Strong normalization and typability with intersection types. Notre Dame J. Formal Logic, 37(1):44--52, 1996.
Two Behavioural Lambda Models - Dezani-Ciancaglini, Ghilezan Self-citation (Ghilezan) (Correct)
No context found.
Silvia Ghilezan. Strong normalization and typability with intersection types. Notre Dame J. Formal Logic, 37(1):44--52, 1996.
Lambda Models Characterizing Computational Behaviours of.. - Dezani-Ciancaglini.. (2001) Self-citation (Ghilezan) (Correct)
No context found.
Silvia Ghilezan. Strong normalization and typability with intersection types. Notre Dame J. Formal Logic, 37(1):44--52, 1996.
Reducibility Method for Intersection Types - Ghilezan, Kuncak (2000) Self-citation (Ghilezan) (Correct)
....property) and other basic results of the simply typed lambda calculus. The original proof of the Church Rosser property of the simply typed lambda calculus using logical relations and the reducibility method is due to Statman [12] and Koletsos [7] In Krivine [9] and later in Ghilezan [5] the reducibility method is applied in order to characterize all and only the strongly normalizing lambda terms in lambda calculus with intersection types. The reducibility method is also used in Gallier [4] for characterizing some special classes of lambda terms such as strongly normalizing ....
Ghilezan, S.: Strong normalization and typability with intersection types. Notre Dame Journal of Formal Logic 37 (1996) 44-53.
Reducibility Method for Simple Types and Church-Rosser Property - Ghilezan, Kuncak (2000) Self-citation (Ghilezan) (Correct)
....method was introduced in [12] for proving the strong normalization property for the simply typed lambda calculus and further developed in [7] and [13] for proving the strong normalization property for the second order lambda calculus. There is an overiew of these proofs in [2] In [11] and [5] the reducibility method is applied in order to characterize all strongly normalizing lambda terms. This method is extended in various ways. On the one hand, in [9] and [10] the reducibility method is used in order to present a uniform way for proving the Church Rosser theorem, the ....
Ghilezan, S.: Strong normalization and typability with intersection types. Notre Dame Journal of Formal Logic 37 (1996) 44-53
Compositional Characterisations of λ-terms.. -.. (2005) (Correct)
No context found.
S. Ghilezan. Strong normalization and typability with intersection types. Notre Dame J. Formal Logic, 37(1):44--52, 1996.
A Linearization of the Lambda-Calculus and Consequences - Kfoury (1996) (Correct)
No context found.
Ghilezan, S., \Strong Normalization and Typability with Intersection Types", Notre Dame J. Formal Logic, Vol 37, no. 1, Winter 1996.
A Linearization of the Lambda-Calculus and Consequences - Kfoury (2000) (Correct)
No context found.
Ghilezan, S., \Strong Normalization and Typability with Intersection Types", Notre Dame J. Formal Logic, Vol 37, no. 1, Winter 1996.
A Linearization of the Lambda-Calculus and Consequences - Kfoury (1996) (Correct)
No context found.
Ghilezan, S., "Strong Normalization and Typability with Intersection Types", Notre Dame J. Formal Logic,Vol 37, no. 1, Winter 1996.
Beta-Reduction As Unification - Kfoury (1996) (8 citations) (Correct)
No context found.
Ghilezan, S., "Strong Normalization and Typability with Intersection Types", Notre Dame J. Formal Logic,Vol 37, no. 1, Winter 1996.
Intersection Types for Explicit Substitutions - Lengrand, Lescanne.. (2003) (Correct)
No context found.
S. Ghilezan. Strong normalization and typability with intersection types. Notre Dame Journal of Formal Logic, 37(1):44--52, 1996.
A Linearization of the Lambda-Calculus and Consequences - Kfoury (2000) (Correct)
No context found.
Ghilezan, S., "Strong Normalization and Typability with Intersection Types", Notre Dame J. Formal Logic, Vol 37, no. 1, Winter 1996.
A Linearization of the Lambda-Calculus and Consequences - Kfoury (1996) (Correct)
No context found.
Ghilezan, S., "Strong Normalization and Typability with Intersection Types", Notre Dame J. Formal Logic, Vol 37, no. 1, Winter 1996.
Characterising Strong Normalisation for Explicit.. - van Bakel.. (2002) (Correct)
No context found.
S. Ghilezan. Strong normalization and typability with intersection types. Notre Dame Journal of Formal Logic, 37(1):44--52, 1996.
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