S. van Bakel and M. FernVndez. Normalisation, Approximation, and Semantics for Combinator Systems. Theoretical Computer Science, 2002. To appear. 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 Self-citation (Van bakel) (Correct)
....These properties immediately show that type assignment even in the system that does not contain [1] is undecidable. However, in the context of weak reduction, the approximation result is no longer obtained via a straightforward application of the same technique. Rather, as argued and shown in [6, 8], to obtain this result in the context of Combinator Systems or Term Rewriting Systems, a more general solution was needed: strong normalisation of cut elimination. Perhaps surprisingly, the machinery involved to prove this gives the characterisation results for typeable terms as a corollary. In ....
S. van Bakel and M. FernVndez. Normalisation, Approximation, and Semantics for Combinator Systems. Theoretical Computer Science, 2002. To appear.
Cut-Elimination in the Strict Intersection Type Assignment.. - van Bakel Self-citation (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. van Bakel, F. Barbanera, M. Dezani-Ciacaglini, and F.-J. de Vries. Intersection Types for -Trees. Theoretical Computer Science, 272:3--40, 2002.
A lambda calculus for D∞ - Severi, de Vries (2002) Self-citation (De vries) (Correct)
....However, in nite) reduction with the usual , rules and the rule based on head normal forms is not powerful enough to calculate 1 B ohm trees of lambda terms. In [SV02] we proved that in nite reduction with those three rules captures another class of B ohm trees, the B ohm trees [BBDCV02] which are normal forms of the standard B ohm trees. Barendregt tried to capture some form of in nite conversion in his de nition of the 1 construction on B ohm trees (cf. pages 231237 in [Bar84] This construction identi es more B ohm trees then the normal form construction. The ....
S. van Bakel, F. Barbanera, M. Dezani-Ciancaglini, and F.J. de Vries. Intersection types for -trees. Theoretical Computer Science, 272(1-2):3-40, 2002.
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