## Higher-order rewriting via conditional first-order rewriting in the open calculus of constructions

Venue: | Informatik Berichte. Department of Computer Science |

Citations: | 1 - 1 self |

### BibTeX

@INPROCEEDINGS{Stehr_higher-orderrewriting,

author = {Mark-oliver Stehr},

title = {Higher-order rewriting via conditional first-order rewriting in the open calculus of constructions},

booktitle = {Informatik Berichte. Department of Computer Science},

year = {}

}

### OpenURL

### Abstract

Abstract. Although higher-order rewrite systems (HRS) seem to have a first-order flavor, the direct translation into first-order rewrite systems, using e.g. explicit substitutions, is by no means trivial. In this paper, we explore a two-stage approach, by showing how higher-order pattern rewrite systems, and in fact a somewhat more general class, can be expressed by conditional first-order rewriting in the open calculus of constructions (OCC), which itself has been presented and implemented using explicit substitutions. The key feature of OCC that we exploit is that conditions are allowed to contain quantifiers and equations which can be solved using first-order matching. The way we express HRS works in spite of the fact that structural equality of OCC does not subsume α-conversion. Another topic that we touch upon in this paper is the use of higher-order abstract syntax in a classical framework like OCC, because it is often used in connection with higher-order rewriting. 1

### Citations

716 | A framework for defining logics
- Harper, Honsell, et al.
- 1993
(Show Context)
Citation Context ...der Abstract Syntax Higher-order abstract syntax [26] has been proposed as a systematic approach to represent the abstract syntax of languages with binding constructs in logical frameworks such as LF =-=[12]-=-. The main idea is to represent the binding constructs of the object language using binding constructs of the metalanguage, i.e. to aim at a shallow embedding. The advantage of using higher-order abst... |

552 | Lambda calculi with types
- Barendregt
- 1992
(Show Context)
Citation Context ... a priori distinction between terms and types, and furthermore between types and propositions, we use all these notions synonymously. OCC has the standard constructs known from pure type systems (cf. =-=[1,29,30]-=-) and a few additional ones. An OCC term can be one of the following: a universe s, a variable Xi (CINNI syntax), a typed λ-abstraction [X : S]M, a dependent function type {X : S}T , a type assertion ... |

511 |
Conditional rewriting logic as a unified model of concurrency
- Meseguer
- 1992
(Show Context)
Citation Context ...ypes in the style of Martin-Löf’s type theory [25] and the calculus of constructions [7], and (2) algebraic specification languages in the style of membership equational logic [4] and rewriting logic =-=[20]-=- as implemented in Maude [6]. The simulation of HRS in OCC is possible thanks the operational semantics of conditional computational equations in OCC, but we will see that there is still a gap between... |

497 |
The calculus of constructions
- Coquand, Huet
- 1988
(Show Context)
Citation Context ...d indexed variables. OCC was designed to integrate two lines of research, which are: (1) λ-calculi with dependent types in the style of Martin-Löf’s type theory [25] and the calculus of constructions =-=[7]-=-, and (2) algebraic specification languages in the style of membership equational logic [4] and rewriting logic [20] as implemented in Maude [6]. The simulation of HRS in OCC is possible thanks the op... |

311 |
Higher-order abstract syntax
- Pfenning, Elliott
(Show Context)
Citation Context ...mounts to a fresh variable X that can be used to symbolically verify (id X) = X, in this case using the built-in β-reduction. 9s4.3 Rewriting Higher-Order Abstract Syntax Higher-order abstract syntax =-=[26]-=- has been proposed as a systematic approach to represent the abstract syntax of languages with binding constructs in logical frameworks such as LF [12]. The main idea is to represent the binding const... |

295 | A logic programming language with lambda-abstraction, function variables, and simple unification
- Miller
(Show Context)
Citation Context ...INNI, that is explicit substitutions with names. Another closely related line of work, from which the idea of higher-order patterns originated, is the work on higher-order logic programming, see e.g. =-=[21]-=-, which is based on the more powerful concept of (higher-order) unification (modulo α-conversion), rather than matching (without α-conversion) which we use in this paper. Last but not least, we addres... |

274 |
Programming in Martin-Löf’s Type Theory: an introduction
- Nordström, Petersson, et al.
- 1990
(Show Context)
Citation Context ...calculus of substitutions with named and indexed variables. OCC was designed to integrate two lines of research, which are: (1) λ-calculi with dependent types in the style of Martin-Löf’s type theory =-=[25]-=- and the calculus of constructions [7], and (2) algebraic specification languages in the style of membership equational logic [4] and rewriting logic [20] as implemented in Maude [6]. The simulation o... |

262 |
Combinatory Reduction Systems
- Klop
- 1980
(Show Context)
Citation Context ...ders and to perform rewriting modulo a substitution calculus that correctly handles instantiation of such binders [33]. Two natural frameworks have evolved, namely combinatory reduction systems (CRS) =-=[15]-=- and higher-order rewrite systems (HRS) [23], called pattern rewrite systems in [19,24], and both formalisms have been shown to have essentially the same expressive power [32]. In the case of higher-o... |

216 |
Descriptive Set Theory
- Moschovakis
- 1980
(Show Context)
Citation Context ...and the calculus of inductive constructions CIC [34]. A set-theoretic universe 3 is a set that is closed under the standard constructions of Zermelo-Fraenkel set theory with the axiom of choice (ZFC) =-=[22,27]-=-. In this paper we work with a fixed but arbitrary OCC frame for Σ, i.e. a family of sets (Us)s∈S and satisfies the following conditions: For the OCC universe s = Prop we require Us = {∅, {•}}, that i... |

133 |
Higher-order critical pairs
- Nipkow
- 1991
(Show Context)
Citation Context ...itution calculus that correctly handles instantiation of such binders [33]. Two natural frameworks have evolved, namely combinatory reduction systems (CRS) [15] and higher-order rewrite systems (HRS) =-=[23]-=-, called pattern rewrite systems in [19,24], and both formalisms have been shown to have essentially the same expressive power [32]. In the case of higher-order rewrite systems (HRS), the underlying s... |

114 | Specification and proof in membership equational logic
- Bouhoula, Jouannaud, et al.
- 2000
(Show Context)
Citation Context ...calculi with dependent types in the style of Martin-Löf’s type theory [25] and the calculus of constructions [7], and (2) algebraic specification languages in the style of membership equational logic =-=[4]-=- and rewriting logic [20] as implemented in Maude [6]. The simulation of HRS in OCC is possible thanks the operational semantics of conditional computational equations in OCC, but we will see that the... |

114 |
Computation and reasoning. A type theory for computer science., volume 11
- Luo
- 1994
(Show Context)
Citation Context ...n classical set theory with suitable universes [29]. A similar semantics has been used for Martin-Löf’s type theory [8,9] and for predicative universes of the extended calculus of constructions (ECC) =-=[17]-=- and the calculus of inductive constructions CIC [34]. A set-theoretic universe 3 is a set that is closed under the standard constructions of Zermelo-Fraenkel set theory with the axiom of choice (ZFC)... |

111 |
a calculus of explicit substitutions which preserves strong normalisation
- Benaissa, Briaud, et al.
- 1996
(Show Context)
Citation Context ...in the near future. 2 Preliminaries For a uniform way to deal with binding in the presentation of OCC we use CINNI [29,28], a generic calculus of explicit substitutions that generalizes Lescanne’s λυ =-=[2]-=- and can be instantiated to the syntax of nearly arbitrary object languages. We say that the syntax of an object language is a CINNI syntax if there is a distinguished sort of names and all variables,... |

88 | Combinatory reduction systems: Introduction and survey
- Klop, Oostrom, et al.
- 1993
(Show Context)
Citation Context ...ually covers a more general class. The following equation does not fit into the restricted form of HRS or CRS, because H is applied to a pattern which is not simply a variable. As pointed out in e.g. =-=[16]-=- it might be desirable to extend HRS/CRS to include rules like this. 18sf : (nat -> nat) -> nat . g : (nat -> nat) -> nat . eq : !! {H : nat -> nat} (f ([X : nat] (H (suc X)))) = (g ([X : nat] (H X)))... |

78 | Inductive sets and families in Martin-Löf’s type theory and their settheoretic semantics
- Dybjer
- 1991
(Show Context)
Citation Context ...instance of OCC, it is straightforward to define a model-theoretic semantics based on classical set theory with suitable universes [29]. A similar semantics has been used for Martin-Löf’s type theory =-=[8,9]-=- and for predicative universes of the extended calculus of constructions (ECC) [17] and the calculus of inductive constructions CIC [34]. A set-theoretic universe 3 is a set that is closed under the s... |

68 | Higher-order rewrite systems and their confluence
- Mayr, Nipkow
- 1998
(Show Context)
Citation Context ...instantiation of such binders [33]. Two natural frameworks have evolved, namely combinatory reduction systems (CRS) [15] and higher-order rewrite systems (HRS) [23], called pattern rewrite systems in =-=[19,24]-=-, and both formalisms have been shown to have essentially the same expressive power [32]. In the case of higher-order rewrite systems (HRS), the underlying substitution calculus is simply typed λ-calc... |

59 |
Maude: Specification and programming in rewriting logic. Theoretical Computer Science
- Clavel, Durán, et al.
- 2001
(Show Context)
Citation Context ...öf’s type theory [25] and the calculus of constructions [7], and (2) algebraic specification languages in the style of membership equational logic [4] and rewriting logic [20] as implemented in Maude =-=[6]-=-. The simulation of HRS in OCC is possible thanks the operational semantics of conditional computational equations in OCC, but we will see that there is still a gap between ⋆ Support by ONR Grant N000... |

56 | Unification via explicit substitutions: The case of higher-order patterns
- Dowek, Hardin, et al.
- 1996
(Show Context)
Citation Context ...out the strategy used to solve conditions. We decided to make such assumptions syntactically explicit using the concept of matching equations [5]. There is some related work in this direction, namely =-=[3,10]-=-, where explicit substitutions calculi based on de Bruijn indices are directly used to represent higher-order concepts. Our approach, on the other hand, proceeds in two stages: HRS are represented in ... |

54 | Five axioms of alpha conversion
- Gordon, Melham
- 1996
(Show Context)
Citation Context ...app (abs B) M) = (B M)) . red (app (abs ([x : term] x)) (abs ([x : term] x))) . result: (abs ([x : term] x)) Initial models of this specification can be constructed, e.g. using an approach similar to =-=[11]-=- based on de Bruijn indices. 6 Conclusion In all our examples the use of conditional equations allows us to avoid binding constructs in patterns. The patterns that we use on the left hand side of comp... |

48 |
Categories for the working mathematician, volume 5 of Graduate Texts in Mathematics
- MacLane
- 1971
(Show Context)
Citation Context ...CC terms: [α] = α [s] = Us [M N ] = [M ]([N ]) [[X : S]M ] = λ α ∈ [S ] . [[X:=α]M ] if [[S ] ∈ U [{X : S}T ] = Π α ∈ [S ] . [[X:=α]T ] if [[S ] ∈ U 3 called Z-F universe in [22] and just universe in =-=[18]-=- 4 We also make use of the standard convention that a set-theoretic formula can only hold and a set-theoretic expression can only be defined if all its subexpressions are defined. 4s[M : S ] = [M ] if... |

44 | A finite axiomatization of inductiverecursive definitions
- Dybjer, Setzer
- 1999
(Show Context)
Citation Context ...instance of OCC, it is straightforward to define a model-theoretic semantics based on classical set theory with suitable universes [29]. A similar semantics has been used for Martin-Löf’s type theory =-=[8,9]-=- and for predicative universes of the extended calculus of constructions (ECC) [17] and the calculus of inductive constructions CIC [34]. A set-theoretic universe 3 is a set that is closed under the s... |

26 | Towards Maude 2.0
- Clavel, Durán, et al.
- 2000
(Show Context)
Citation Context ... nature of our representation, and requires assumptions about the strategy used to solve conditions. We decided to make such assumptions syntactically explicit using the concept of matching equations =-=[5]-=-. There is some related work in this direction, namely [3,10], where explicit substitutions calculi based on de Bruijn indices are directly used to represent higher-order concepts. Our approach, on th... |

24 |
1977]: Axioms of Set Theory
- Shoenfield
(Show Context)
Citation Context ...and the calculus of inductive constructions CIC [34]. A set-theoretic universe 3 is a set that is closed under the standard constructions of Zermelo-Fraenkel set theory with the axiom of choice (ZFC) =-=[22,27]-=-. In this paper we work with a fixed but arbitrary OCC frame for Σ, i.e. a family of sets (Us)s∈S and satisfies the following conditions: For the OCC universe s = Prop we require Us = {∅, {•}}, that i... |

21 |
CINNI — A generic calculus of explicit substitutions and its application to λ-, ς- and picalculi
- Stehr
(Show Context)
Citation Context ...es, but its operational semantics is based on first-order rewriting and goal-oriented proof search. Built-in higher-order features, such as β-reduction are mapped to first-order rewriting using CINNI =-=[29,28]-=-, a calculus of substitutions with named and indexed variables. OCC was designed to integrate two lines of research, which are: (1) λ-calculi with dependent types in the style of Martin-Löf’s type the... |

21 | A proof search specification of the π-calculus
- Tiu, Miller
- 2004
(Show Context)
Citation Context ...S is to consider them as the specification of a transition system, similar to the rewrite rules of rewriting logic [20]. Some recent work on representing π-calculus using higher-order abstract syntax =-=[31]-=- suggests that this interpretation might be useful for symbolic analysis of systems at a level more abstract (because it does not distinguish α-equivalent states) than a naive first-order representati... |

20 | Comparing combinatory reduction systems and higher-order rewrite systems
- Oostrom, Raamsdonk
- 1993
(Show Context)
Citation Context ... reduction systems (CRS) [15] and higher-order rewrite systems (HRS) [23], called pattern rewrite systems in [19,24], and both formalisms have been shown to have essentially the same expressive power =-=[32]-=-. In the case of higher-order rewrite systems (HRS), the underlying substitution calculus is simply typed λ-calculus with β-reduction and restricted η-expansion. The main objective of this paper is to... |

15 |
Higher-order rewriting and equational reasoning
- Nipkow, Prehofer
- 1998
(Show Context)
Citation Context ...instantiation of such binders [33]. Two natural frameworks have evolved, namely combinatory reduction systems (CRS) [15] and higher-order rewrite systems (HRS) [23], called pattern rewrite systems in =-=[19,24]-=-, and both formalisms have been shown to have essentially the same expressive power [32]. In the case of higher-order rewrite systems (HRS), the underlying substitution calculus is simply typed λ-calc... |

12 | Sets in types, types in sets
- Werner
- 1997
(Show Context)
Citation Context ...A similar semantics has been used for Martin-Löf’s type theory [8,9] and for predicative universes of the extended calculus of constructions (ECC) [17] and the calculus of inductive constructions CIC =-=[34]-=-. A set-theoretic universe 3 is a set that is closed under the standard constructions of Zermelo-Fraenkel set theory with the axiom of choice (ZFC) [22,27]. In this paper we work with a fixed but arbi... |

8 |
Interactive Theorem Proving — Towards a Unified Language based on Equational Logic, Rewriting Logic, and Type Theory
- Programming
- 2002
(Show Context)
Citation Context ...s with β-reduction and restricted η-expansion. The main objective of this paper is to explore how HRS can be expressed by conditional first-order rewriting in the open calculus of constructions (OCC) =-=[29]-=-. OCC is an equational type theory with dependent types, but its operational semantics is based on first-order rewriting and goal-oriented proof search. Built-in higher-order features, such as β-reduc... |

6 | From higher-order to first-order rewriting
- Bonelli, Kesner, et al.
(Show Context)
Citation Context ...out the strategy used to solve conditions. We decided to make such assumptions syntactically explicit using the concept of matching equations [5]. There is some related work in this direction, namely =-=[3,10]-=-, where explicit substitutions calculi based on de Bruijn indices are directly used to represent higher-order concepts. Our approach, on the other hand, proceeds in two stages: HRS are represented in ... |

4 |
Pure type systems in rewriting logic. In From ObjectOrientation to Formal Methods: Dedicated to The Memory of Ole-Johan Dahl, volume 2635 of LNCS
- Stehr, Meseguer
- 2004
(Show Context)
Citation Context ...itutions can be eliminated. 6 To be precise we should distinguish between two notions of β-reduction: HRS uses the standard one which allows α-conversion, and OCC uses CINNI and hence preserves names =-=[30]-=-. 15s(at the structural and computational level), we allow for some extra αη-conversion after the simulation step. We do not explicitly mention the trivial β0-conversion, because according to our conv... |

2 |
Semantical analysis of higher-order abstract syntax
- Hoffmann
- 1999
(Show Context)
Citation Context ...principle would allows us to construct elements in term that do not represent terms in the λ-calculus, and the same problem occurs with the induction principle if we assume the axiom of unique choice =-=[13]-=-. An even more serious problem with that specification appears if we need β-equality for the represented λ-terms. Our addition of β-equality as an axiom requires abs to be injective, which is clearly ... |

2 |
Executable higher-order algebraic specifications
- Jouannaud
- 1991
(Show Context)
Citation Context ...apabilities of HRS. 20sThe underlying assumption of this paper is that HRS are interpreted as the specification of an equational theory, similar to the spirit of higher-order algebraic specifications =-=[14]-=-. A less abstract interpretation of HRS is to consider them as the specification of a transition system, similar to the rewrite rules of rewriting logic [20]. Some recent work on representing π-calcul... |

2 |
Confluence and normalization for higher order rewriting
- Raamsdonk
- 1996
(Show Context)
Citation Context ...t-order rewriting to the higher-order case, that is to allow patterns that contain binders and to perform rewriting modulo a substitution calculus that correctly handles instantiation of such binders =-=[33]-=-. Two natural frameworks have evolved, namely combinatory reduction systems (CRS) [15] and higher-order rewrite systems (HRS) [23], called pattern rewrite systems in [19,24], and both formalisms have ... |