In this paper we present the algebraic--cube, an extension of Barendregt's -cube with first- and higherorder algebraic rewriting. We show that strong normalization is a modular property of all systems in the algebraic--cube, provided that the first-order rewrite rules are non-duplicating and the higher-order rules satisfy the general schema of Jouannaud and Okada. This result is proven for the algebraic extension of the Calculus of Constructions, which contains all the systems of the algebraic--cube. We also prove that local confluence is a modular property of all the systems in the algebraic--cube, provided that the higher-order rules do not introduce critical pairs. This property and the strong normalization result imply the modulari...
This dissertation examines some aspects of the relationship between λ calculus and universal algebr...
We present an Isabelle formalization of abstract rewriting (see, e.g., [1]). First, we define standa...
AbstractThe Strong Categorical Combinatory Logic (CCL, CCLβηSP), developed by Curien (1986) is, when...
AbstractIt is well known that confluence and strong normalization are preserved when combining algeb...
It is well known that confluence and strong normalization are preserved when combining left-linear a...
The linear-algebraic lambda-calculus and the algebraic lambda-calculus are untyped lambda-calculi ex...
AbstractWe study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda...
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term re...
International audienceThe linear-algebraic lambda-calculus and the algebraic lambda-calculus are unt...
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term re...
AbstractWe study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda...
AbstractThe confluence of untyped λ-calculus with unconditional rewriting is now well un- derstood. ...
Convergent rewriting systems on algebraic structures give methods to solve decision problems, to pro...
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term re...
The confluence of untyped λ-calculus with unconditional rewriting is now well un-derstood. In this p...
This dissertation examines some aspects of the relationship between λ calculus and universal algebr...
We present an Isabelle formalization of abstract rewriting (see, e.g., [1]). First, we define standa...
AbstractThe Strong Categorical Combinatory Logic (CCL, CCLβηSP), developed by Curien (1986) is, when...
AbstractIt is well known that confluence and strong normalization are preserved when combining algeb...
It is well known that confluence and strong normalization are preserved when combining left-linear a...
The linear-algebraic lambda-calculus and the algebraic lambda-calculus are untyped lambda-calculi ex...
AbstractWe study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda...
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term re...
International audienceThe linear-algebraic lambda-calculus and the algebraic lambda-calculus are unt...
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term re...
AbstractWe study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda...
AbstractThe confluence of untyped λ-calculus with unconditional rewriting is now well un- derstood. ...
Convergent rewriting systems on algebraic structures give methods to solve decision problems, to pro...
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term re...
The confluence of untyped λ-calculus with unconditional rewriting is now well un-derstood. In this p...
This dissertation examines some aspects of the relationship between λ calculus and universal algebr...
We present an Isabelle formalization of abstract rewriting (see, e.g., [1]). First, we define standa...
AbstractThe Strong Categorical Combinatory Logic (CCL, CCLβηSP), developed by Curien (1986) is, when...