F. Kamareddine, R'ios and J.B. Wells, Calculi of Generalised fi-Reduction and Explicit Substitutions: The Type free and Simply Typed Versions. To appear in the Journal of Functional and Logic Programming, Volume 1998, ISSN 1080-5230, (MIT Press, 1998). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Soundness of Explicit Substitution with Nameless Variables - Kamareddine Self-citation (Kamareddine) (Correct)
....ff equivalent terms are identifiable. In [18] s, the subsystem of B where oe generation does not preserve the ffi couple, has been studied. s along with the system of [4] are the first calculi of explicit substitution which enjoy confluence on closed terms and preserve strong normalisation. In [19], it was shown that in the simply typed version of s, welltyped terms are strongly normalising. In [20] it was shown that s extended with open terms is confluent. At the moment, we are extending the work of [18,19,20] to study the properties of s where oe generation preserves the ffi couple, ....
....which enjoy confluence on closed terms and preserve strong normalisation. In [19] it was shown that in the simply typed version of s, welltyped terms are strongly normalising. In [20] it was shown that s extended with open terms is confluent. At the moment, we are extending the work of [18,19,20] to study the properties of s where oe generation preserves the ffi couple, hence resulting in the system B of this paper. Finally, Daniel Briaud noted our attention that adding intersection types to [4] is problematic as there will be terms that are strongly normalising but not typable. This is ....
F. Kamareddine, R'ios and J.B. Wells, Calculi of Generalised fi-Reduction and Explicit Substitutions: The Type free and Simply Typed Versions. To appear in the Journal of Functional and Logic Programming, Volume 1998, ISSN 1080-5230, (MIT Press, 1998).
Relating Typability and Expressiveness in Finite-Rank .. - Kfoury, Mairson.. (1999) Self-citation (Wells) (Correct)
....redexes. Let T nf denote the function such that T nf(M) is the (unique) T normal form of M . See [KW95] for a discussion of similar notions of reduction in the literature. There is a close connection with notions of generalized fi reduction which can contract the implicit redexes directly [Kam96, KRW98]. Making all implicit redexes into explicit redexes serves two major purposes in System I k type inference: 1) it allows postponing fi K redexes forever, and (2) it makes a subsequent complete development of all fi I redexes reduce (a component of) the rank of a System I k typing. Purpose (1) ....
F. Kamareddine, A. R'ios, and J. B. Wells. Calculi of generalised fi-reduction and explicit substitutions: The type free and simply typed versions. J. Functional & Logic Programming, 1998(5), June 1998.
The Soundness of Explicit Substitution with Nameless Variables - Kamareddine (1995) Self-citation (Kamareddine) (Correct)
....ff equivalent terms are identifiable. In [18] s, the subsystem of B where oe generation does not preserve the ffi couple, has been studied. s along with the system of [4] are the first calculi of explicit substitution which enjoy confluence on closed terms and preserve strong normalisation. In [19], it was shown that in the simply typed version of s, welltyped terms are strongly normalising. In [20] it was shown that s extended with open terms is confluent. At the moment, we are extending the work of [18,19,20] to study the properties of s where oe generation preserves the ffi couple, ....
....which enjoy confluence on closed terms and preserve strong normalisation. In [19] it was shown that in the simply typed version of s, welltyped terms are strongly normalising. In [20] it was shown that s extended with open terms is confluent. At the moment, we are extending the work of [18,19,20] to study the properties of s where oe generation preserves the ffi couple, hence resulting in the system B of this paper. Finally, Daniel Briaud noted our attention that adding intersection types to [4] is problematic as there will be terms that are strongly normalising but not typable. This is ....
F. Kamareddine, R'ios and J.B. Wells, Calculi of Generalised fi-Reduction and Explicit Substitutions: The Type free and Simply Typed Versions. To appear in the Journal of Functional and Logic Programming, Volume 1998, ISSN 1080-5230, (MIT Press, 1998).
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