Results 1  10
of
14
The Barendregt Cube with Definitions and Generalised Reduction
, 1997
"... In this paper, we propose to extend the Barendregt Cube by generalising reduction and by adding definition mechanisms. We show that this extension satisfies all the original properties of the Cube including Church Rosser, Subject Reduction and Strong Normalisation. Keywords: Generalised Reduction, ..."
Abstract

Cited by 37 (17 self)
 Add to MetaCart
In this paper, we propose to extend the Barendregt Cube by generalising reduction and by adding definition mechanisms. We show that this extension satisfies all the original properties of the Cube including Church Rosser, Subject Reduction and Strong Normalisation. Keywords: Generalised Reduction, Definitions, Barendregt Cube, Church Rosser, Subject Reduction, Strong Normalisation. Contents 1 Introduction 3 1.1 Why generalised reduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Why definition mechanisms . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.3 The item notation for definitions and generalised reduction . . . . . . . . . . 4 2 The item notation 7 3 The ordinary typing relation and its properties 10 3.1 The typing relation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 3.2 Properties of the ordinary typing relation . . . . . . . . . . . . . . . . . . . . 13 4 Generalising reduction in the Cube 15 4.1 The generalised...
Strongly Typed FlowDirected Representation Transformations (Extended Abstract)
 In ICFP ’97 [ICFP97
, 1997
"... We present a new framework for transforming data representations in a strongly typed intermediate language. Our method allows both value producers (sources) and value consumers (sinks) to support multiple representations, automatically inserting any required code. Specialized representations can be ..."
Abstract

Cited by 29 (13 self)
 Add to MetaCart
We present a new framework for transforming data representations in a strongly typed intermediate language. Our method allows both value producers (sources) and value consumers (sinks) to support multiple representations, automatically inserting any required code. Specialized representations can be easily chosen for particular source/sink pairs. The framework is based on these techniques: 1. Flow annotated types encode the "flowsfrom" (source) and "flowsto" (sink) information of a flow graph. 2. Intersection and union types support (a) encoding precise flow information, (b) separating flow information so that transformations can be well typed, (c) automatically reorganizing flow paths to enable multiple representations. As an instance of our framework, we provide a function representation transformation that encompasses both closure conversion and inlining. Our framework is adaptable to data other than functions.
Calculi of Generalised βReduction and Explicit Substitutions: The TypeFree and Simply Typed Versions
, 1998
"... Extending the λcalculus with either explicit substitution or generalized reduction has been the subject of extensive research recently, and still has many open problems. This paper is the first investigation into the properties of a calculus combining both generalized reduction and explicit substit ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
Extending the λcalculus with either explicit substitution or generalized reduction has been the subject of extensive research recently, and still has many open problems. This paper is the first investigation into the properties of a calculus combining both generalized reduction and explicit substitutions. We present a calculus, gs, that combines a calculus of explicit substitution, s, and a calculus with generalized reduction, g. We believe that gs is a useful extension of the  calculus, because it allows postponement of work in two different but complementary ways. Moreover, gs (and also s) satisfies properties desirable for calculi of explicit substitutions and generalized reductions. In particular, we show that gs preserves strong normalization, is a conservative extension of g, and simulates fireduction of g and the classical calculus. Furthermore, we study the simply typed versions of s and gs, and show that welltyped terms are strongly normalizing and that other properties,...
HigherOrder Families
 In International Conference on Rewriting Techniques and Applications '96, LNCS
, 1996
"... A redex family is a set of redexes which are `created in the same way'. Families specify which redexes should be shared in any socalled optimal implementation of a rewriting system. We formalise the notion of family for orthogonal higherorder term rewriting systems (OHRSs). In order to comfort our ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
A redex family is a set of redexes which are `created in the same way'. Families specify which redexes should be shared in any socalled optimal implementation of a rewriting system. We formalise the notion of family for orthogonal higherorder term rewriting systems (OHRSs). In order to comfort our formalisation of the intuitive concept of family, we actually provide three conceptually different formalisations, via labelling, extraction and zigzag and show them to be equivalent. This generalises the results known from literature and gives a firm theoretical basis for the optimal implementation of OHRSs. 1. Introduction A computation of a result is optimal if its cost is minimal among all computations of the result. Taking rewrite steps as computational units the cost of a rewrite sequence is simply its length. Given a rewrite system the question then is: does an effective optimal strategy exist for it? In the case of lambda calculus, a discouraging result was obtained in [BBKV76]: th...
New Notions of Reduction and NonSemantic Proofs of Strong βNormalization in Typed λCalculi
 PROCEEDINGS OF LOGIC IN COMPUTER SCIENCE
, 1995
"... Two notions of reduction for terms of the λcalculus are introduced and the question of whether a λterm is βstrongly normalizing is reduced to the question of whether a λterm is merely normalizing under one of the notions of reduction. This gives a method to prove strong βnormalization for typ ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Two notions of reduction for terms of the λcalculus are introduced and the question of whether a λterm is βstrongly normalizing is reduced to the question of whether a λterm is merely normalizing under one of the notions of reduction. This gives a method to prove strong βnormalization for typed λcalculi. Instead of the usual semantic proof style based on Tait's realizability or Girard's "candidats de réductibilité", termination can be proved using a decreasing metric over a wellfounded ordering. This proof method is applied to the simplytyped λcalculus and the system of intersection types, giving the first nonsemantic proof for a polymorphic extension of the λcalculus.
On Weak and Strong Normalisations
, 1996
"... With the help of continuations, we first construct a transformation T which transforms every  term t into a Iterm T (t). Then we apply the conservation theorem in calculus to show that t is strongly normalisable if T (t) has a finormal form. In this way, we succeed in establishing the equivalenc ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
With the help of continuations, we first construct a transformation T which transforms every  term t into a Iterm T (t). Then we apply the conservation theorem in calculus to show that t is strongly normalisable if T (t) has a finormal form. In this way, we succeed in establishing the equivalence between weak and strong normalisation theorems in various typed calculi. This not only enhances the understanding between weak and strong normalisations, but also presents an elegant approach to proving strong normalisation theorems via the notion of weak normalisations.
Perpetual Reductions in λCalculus
, 1999
"... This paper surveys a part of the theory of fireduction in calculus which might aptly be called perpetual reductions. The theory is concerned with perpetual reduction strategies, i.e., reduction strategies that compute infinite reduction paths from terms (when possible), and with perpetual red ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
This paper surveys a part of the theory of fireduction in calculus which might aptly be called perpetual reductions. The theory is concerned with perpetual reduction strategies, i.e., reduction strategies that compute infinite reduction paths from terms (when possible), and with perpetual redexes, i.e., redexes whose contraction in terms preserves the possibility (when present) of infinite reduction paths. The survey not only recasts classical theorems in a unified setting, but also offers new results, proofs, and techniques, as well as a number of applications to problems in calculus and type theory. 1. Introduction Considerable attention has been devoted to classification of reduction strategies in typefree calculus [4, 6, 7, 15, 38, 44, 81]see also [2, Ch. 13]. We are concerned with strategies differing in the length of reduction paths. This paper draws on several sources. In late 1994, van Raamsdonk and Severi [59] and Srensen [66, 67] independently developed ...
Perpetual Reductions in λCalculus
, 1999
"... This paper surveys a part of the theory of fireduction in λcalculus which might aptly be called perpetual reductions. The theory is concerned with perpetual reduction strategies, i.e., reduction strategies that compute infinite reduction paths from λterms (when possible), and with perpetual r ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
This paper surveys a part of the theory of fireduction in λcalculus which might aptly be called perpetual reductions. The theory is concerned with perpetual reduction strategies, i.e., reduction strategies that compute infinite reduction paths from λterms (when possible), and with perpetual redexes, i.e., redexes whose contraction in λterms preserves the possibility (when present) of infinite reduction paths. The survey not only recasts classical theorems in a unified setting, but also offers new results, proofs, and techniques, as well as a number of applications to problems in λcalculus and type theory.
Weak Normalization Implies Strong Normalization in Generalized NonDependent Pure Type Systems
 Comput. Sci
, 1997
"... The BarendregtGeuversKlop conjecture states that every weakly normalizing pure type system is also strongly normalizing. We show that this is true for a uniform class of systems which includes, e.g., the left hand side of Barendregt's cube as well as the system U . This seems to be the first resu ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
The BarendregtGeuversKlop conjecture states that every weakly normalizing pure type system is also strongly normalizing. We show that this is true for a uniform class of systems which includes, e.g., the left hand side of Barendregt's cube as well as the system U . This seems to be the first result giving a positive answer to the conjecture not merely for some concrete systems for which strong normalization is known to hold, but for a uniform class of systems in which not all systems are strongly normalizing. 1.
Weak and Strong Beta Normalisations in Typed λCalculi
 In: Proc. of the 3 rd International Conference on Typed Lambda Calculus and Applications, TLCA'97
, 1997
"... . We present a technique to study relations between weak and strong finormalisations in various typed calculi. We first introduce a translation which translates a term into a Iterm, and show that a term is strongly finormalisable if and only if its translation is weakly finormalisable. We t ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
. We present a technique to study relations between weak and strong finormalisations in various typed calculi. We first introduce a translation which translates a term into a Iterm, and show that a term is strongly finormalisable if and only if its translation is weakly finormalisable. We then prove that the translation preserves typability of terms in various typed calculi. This enables us to establish the equivalence between weak and strong finormalisations in these typed calculi. This translation can deal with Curry typing as well as Church typing, strengthening some recent closely related results. This may bring some insights into answering whether weak and strong finormalisations in all pure type systems are equivalent. 1 Introduction In various typed calculi, one of the most interesting and important properties on terms is how they can be fireduced to finormal forms. A term M is said to be weakly finormalisable (WN fi (M )) if it can be fireduced to a fin...