M. Vittek. ELAN: Un Cadre Logique pour le Prototypage de Langages de Programmation avec Contraintes. PhD thesis, Universite Henri Poincare -- Nancy I, Nov. 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....represented. Several research groups have developed language tools to support formal reasoning and executable specification in rewriting logic. The ELAN language is a rewriting logic language developed at INRIA Lorraine by P. Borovansk y, C. Kirchner, H. Kirchner, P. E. Moreau and M. Vittek [79, 160, 20]. It has as modules computational systems , consisting of a rewrite theory and a strategy to guide the rewriting process [18, 19] This group and their collaborators have developed a very impressive collection of examples and case studies in areas such as logic programming languages, constraint ....

.... the rewriting process [18, 19] This group and their collaborators have developed a very impressive collection of examples and case studies in areas such as logic programming languages, constraint solving, higher order substitution, equational theorem proving and other such computational systems [79, 160, 81, 16, 26, 145, 61, 62]. Besides the ELAN interpreter, there is ongoing work on compilation techniques, including compilation of ACrewriting [130] A nice feature of rewriting logic, namely its natural way of dealing with concurrency and interaction, is exploited by Viry to treat input output for ELAN within the logic ....

[Article contains additional citation context not shown here]

M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. PhD thesis, Universit'e Henry Poincar'e --- Nancy I, 1994.

.... to the sustained e orts of many researchers, particularly in the ELAN, Pisa, Stanford, and Maude teams, there is by now very extensive evidence supporting the claim that rewriting logic is indeed a 5 Clavel et al. very exible and simple semantic framework [21,23,24,4] and logical framework [20,18,34,19,3,32,6,14,7,10]. Moreover, object oriented design languages, architectural description languages, and languages for distributed components also have a natural semantics in rewriting logic [35,25,33,27,28] What is common to all these applications is that the models of computation, logics, or languages are ....

M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. PhD thesis, Universite Henry Poincare | Nancy I, 1994.

....al. way, one can reify translations between two di erent languages or logics L and L 0 as functions from Module L to Module L 0 . Rewriting logic de nitions of several languages have been given by di erent authors: lambda calculus and mini ML [24,25] Prolog and narrowing languages like BABEL [36], CCS (see [33,25] the work of Bruni and Clavel [8,6] and the tile rewrite rules in [20] the calculus [35] and sketches of UNITY [29] and Gamma [30] Similarly, many di erent logics have been shown to have a very natural conservative representation in rewriting logic [25] The point is that ....

M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. PhD thesis, Universite Henry Poincare | Nancy I, 1994. 21

....proof subcalculus CR in rewriting logic that allows as admissible theories rewrite theories that are Church Rosser, terminating and do not have equational axioms, and as admissible conclusions, for a theory T 2 thr(CR) sequents t Gamma t 0 , where t 0 is the T normal form of t. In ELAN [18,6] a different implementation of rewriting logic the challenge of controlling the rewriting inference process was initially addressed through what in our terminology amounts to an external strategy language. More recently, the definition of strategies by rewriting in the context of ELAN has also ....

M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. PhD thesis, Universit'e Henry Poincar'e --- Nancy I, 1994. 11

....of UNITY and Gamma, which are given in some of the references cited in Section 4.1. Secondly, the usefulness of rewriting strategies to specify program evaluations has been clearly demonstrated in ELAN specifications, for example of Prolog and of the functional logic programming language Babel [320], and also in the Maude executable specifications for CCS developed by Bruni and Clavel [63,34] and by Verdejo and Mart i Oliet [311,310] Thirdly, the fact that rewriting logic naturally supports concurrent objects has proved very useful in formally specifying a number of novel concurrent and ....

....strategies. The researchers in the ELAN group have developed an impressive collection of rewriting logic specifications for different automated deduction inference systems, including the already mentioned theorem proving modulo methods [109 111] logical languages, unification and narrowing [169,320], Knuth Bendix completion with constraints [176] higherorder unification [15] combination of unification algorithms [277] constraint solving [46 50] and termination and tree automata techniques [149,150] In a somewhat similar vein, the work of Schorlemmer explores the relationships between ....

[Article contains additional citation context not shown here]

Marian Vittek. ELAN: Un Cadre Logique pour le Prototypage de Langages de Programmation avec Contraintes. PhD thesis, Universit'e Henri Poincar'e -- Nancy I, November 1994.

.... crit eres, nous retenons dn ( Kes96] s ( KR95] se ( KR96] oe ( CHL92] et AE ( Les94] Implantation de (5) machines de r eduction correspondant aux calculs pr ec edents en utilisant ELAN : Pour chaque calcul choisi, nous avons implant e une machine de r eduction en utilisant ELAN ([Vit94]) En effet, il aurait et e tentant de concevoir une machine abstraite pour chaque syst eme mais il est clair qu il existe de nombreuses mani eres de le faire et qu il serait ensuite difficile de comparer equitablement les diff erents calculs. ELAN offre donc l avantage d implanter directement ....

....been kept. Thank to these criteria, we keep dn ( Kes96] s ( KR95] se ( KR96] oe ( CHL92] and AE ( Les94] Implementation of (5) reduction machines corresponding to the previous calculi using ELAN : For each chosen calculus, we have implemented a 11 reduction machine using ELAN [Vit94]) Indeed, it would have been tempting to conceive an abstract machine for each system but it is clear that it would then be difficult to fairly compare the different calculi. ELAN thus has the advantage of implementing directly the rewrite systems describing the calculi in a unified framework to ....

[Article contains additional citation context not shown here]

Marian Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. PhD thesis, Th`ese de l'Universit'e de Nancy 1, Novembre 1994. 60

.... to the sustained efforts of many researchers, particularly in the ELAN, Pisa, Stanford, and Maude teams, there is by now very extensive evidence supporting the claim that rewriting logic is indeed a 5 Clavel et al. very flexible and simple semantic framework [21,23,24,4] and logical framework [20,18,34,19,3,32,6,14,7,10]. Moreover, object oriented design languages, architectural description languages, and languages for distributed components also have a natural semantics in rewriting logic [35,25,33,27,28] What is common to all these applications is that the models of computation, logics, or languages are ....

M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. PhD thesis, Universit'e Henry Poincar'e --- Nancy I, 1994.

....systems have already been proposed, using similar representation for terms, but introducing different operators on substitutions. The main focus of this paper is to practically compare these calculi. From an operational point of view, we have developed prototypes for these calculi, using ELAN ([12]) and we currently experiment various strategies. ELAN allows to describe rewriting systems using a user defined syntax. ELAN permits to prototype and experiment these systems using a unified framework and to easily modify strategies in order to test them. We try to build specific strategies for ....

M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. PhD thesis, These de l'Universite de Nancy 1, Novembre 1994.

....are instead first order. Our work should of course be placed within the context of the above related work, and of experiments carried out in different frameworks to prototype formal systems (for more discussion see the survey [44] 2. 1 Rewriting Logic and Reflection We and other researchers [37, 36, 44, 33, 52, 34, 5, 49, 8, 10, 12] have investigated the suitability of rewriting logic [40] as a logical framework and have found it to have very good properties for this purpose. One important practical advantage is that, what might be called the representational distance between a theory T in the original logic and its ....

M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. PhD thesis, Universit'e Henry Poincar'e --- Nancy I, 1994.

....case, we nd the works on CRS [KvOvR93] XRS [Pag98] and other higher order rewriting systems [Wol93, NP98] in the second case the works on combination of calculus with term rewriting [Oka89, BT88, GBT89, JO97] to mention only a few. Our previous works on the control of term rewriting [KKV95, Vit94, BKKR01] led us to introduce the calculus. Indeed we realized that the tool that is needed in order to control rewriting should be made explicit and could be itself naturally described using rewriting. By viewing the arrow rewrite symbol as an abstraction operator, we strictly generalize the ....

M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. These de Doctorat d'Universite, Universite Henri Poincare { Nancy 1, October 1994.

....prototyping deduction systems in a language based on labeled conditional rewrite rules and strategies to control rule application. The ELAN system o ers a compiler and an interpreter of the language. The ELAN language allows us to describe in a natural and elegant way various deduction systems [Vit94, KKV95, BKK 96] It has been experimented on several non trivial applications ranging from decision procedures, constraint solvers [Cas98] logic programming [KR98] and automated theorem proving [CK97] but also speci cation and exhaustive veri cation of authentication protocols [Cir99] ....

M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. These de Doctorat d'Universite, Universite Henri Poincare { Nancy 1, October 1994.

.... Thanks to the sustained efforts of many researchers, particularly in the ELAN, Pisa, Stanford, and Maude teams, there is by now very extensive evidence supporting the claim that rewriting logic is indeed a very flexible and simple semantic framework [37, 40, 42, 6] and logical framework [32, 29, 62, 30, 2, 55, 8, 16, 10, 12]. Moreover, object oriented design languages, CHAPTER 1. INTRODUCTION 7 architectural description languages, and languages for distributed components also have a natural semantics in rewriting logic [63, 34, 57, 47, 48] see Section 2.8.2 for more discussion on the use of reflection in logical and ....

M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. PhD thesis, Universit'e Henry Poincar'e --- Nancy I, 1994.

....other formal systems can be naturally represented. Several research groups have developed language tools to support formal reasoning and executable specification in rewriting logic. The ELAN language developed at INRIA Lorraine by Borovansk y, C. Kirchner, H. Kirchner, P. E. Moreau and Vittek [46, 103, 16] has as modules computational systems , consisting of a rewrite theory and a strategy to guide the rewriting process. This group and their collaborators have developed a very impressive collection of examples and case studies in areas such as logic programming languages, constraint solving, ....

....to guide the rewriting process. This group and their collaborators have developed a very impressive collection of examples and case studies in areas such as logic programming languages, constraint solving, higher order substitution, equational theorem proving and other such computational systems [46, 103, 49, 14, 18]. A nice feature of rewriting logic, namely its natural way of dealing with concurrency and interaction, is exploited by Viry to treat input output for ELAN within the logic itself [101] Futatsugi and Sawada at Japan Advanced Institute of Science and Technology (JAIST) in Kanazawa are in a very ....

[Article contains additional citation context not shown here]

M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. PhD thesis, Universit'e Henry Poincar'e --- Nancy I, 1994.

....in a language based on computational systems, i.e. sets of rewrite rules with strategies. The language has been developed rst in order to specify in a uniform framework and eciently execute computational systems describing constraint solvers, theorem provers and kernels of programming languages [38, 23, 7]. The language semantics is based on the strategy notion presented above and we now brie y describe some of the strategy features o ered by the system. 7.1. Rewriting with Strategies ELAN provides a kernel that implements the leftmost innermost standard rewriting strategy, the elementary ....

M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. These de Doctorat d'Universite, Universite Henri Poincare { Nancy 1, October 1994.

....on combination of calculus with term rewriting [ Okada, 1989; Breazu Tannen, 1988; Gallier and Breazu Tannen, 1989; Jouannaud and Okada, 1997 ] to mention only a few. We come up with another point of view because of our previous works on the control of term rewriting [ Kirchner et al. 1995; Vittek, 1994; Borovansk y 1 et al. 1998 ] Indeed we realized that the tool needed to control rewriting should be made explicit and could be itself naturally described using rewriting. This leads to the calculus; the rewriting calculus which is a calculus of explicit rule application. In this calculus ....

....rule application. The ELAN system o ers a compiler and an interpreter of the language. The ELAN language allows us to describe in a natural and elegant way various deduction systems and to experiment with for example the combination of theorem provers, constraint solvers and decision procedures [ Vittek, 1994; Kirchner et al. 1995; Borovansk y et al. 1996 ] It has been experimented on several non trivial applications ranging from constraint solvers to logic programming and automated theorem proving 1 . ELAN provides a kernel that implements the leftmost innermost standard rewriting strategy, ....

Marian Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. These de Doctorat d'Universite, Universite Henri Poincare { Nancy 1, October 1994. 25

....sets, our mechanism might allow to deal with them without specific difficulty because of the higher order features included in Prolog, but we have not yet explored this issue. From an operational point of view, we are currently developing a prototype written in a high level framework (ELAN ([19]) well suited to experiment various strategies. In order to get an efficient mechanism, we could also take advantages of various abstract machines ( 15] defined for lambda calculus with explicit substitutions. ....

M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. PhD thesis, These de l'Universite de Nancy 1, Novembre 1994. A Example Let p; q; r and t be predicates symbols defined by:

....systems have already been proposed, using similar representation for terms, but introducing different operators on substitutions. The main focus of this paper is to practically compare these calculi. From an operational point of view, we have developed prototypes for these calculi, using ELAN ([12]) and we currently experiment various strategies. ELAN allows to describe rewriting systems using a user defined syntax. ELAN permits to prototype and experiment these systems in a unified framework and to easily modify strategies in order to test them. We try to build specific strategies for ....

M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. PhD thesis, These de l'Universite de Nancy 1, Novembre 1994.

No context found.

M. Vittek. ELAN: Un Cadre Logique pour le Prototypage de Langages de Programmation avec Contraintes. PhD thesis, Universite Henri Poincare -- Nancy I, Nov. 1994.

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