Search

Your search keyword '"Moreau, Pierre-Etienne"' showing total 161 results
Start Over Author "Moreau, Pierre-Etienne"
161 results on '"Moreau, Pierre-Etienne"'

1. Generic Encodings of Constructor Rewriting Systems

Author

Cirstea, Horatiu and Moreau, Pierre-Etienne

Subjects
Computer Science - Logic in Computer Science, Computer Science - Computation and Language, Computer Science - Programming Languages
Abstract

Rewriting is a formalism widely used in computer science and mathematical logic. The classical formalism has been extended, in the context of functional languages, with an order over the rules and, in the context of rewrite based languages, with the negation over patterns. We propose in this paper a concise and clear algorithm computing the difference over patterns which can be used to define generic encodings of constructor term rewriting systems with negation and order into classical term rewriting systems. As a direct consequence, established methods used for term rewriting systems can be applied to analyze properties of the extended systems. The approach can also be seen as a generic compiler which targets any language providing basic pattern matching primitives. The formalism provides also a new method for deciding if a set of patterns subsumes a given pattern and thus, for checking the presence of useless patterns or the completeness of a set of patterns., Comment: Added appendix with proofs and extended examples

Published
2019

2. Faithful (meta-)encodings of programmable strategies into term rewriting systems

Author

Cirstea, Horatiu, Lenglet, Serguei, and Moreau, Pierre-Etienne

Subjects
Computer Science - Programming Languages, F.4
Abstract

Rewriting is a formalism widely used in computer science and mathematical logic. When using rewriting as a programming or modeling paradigm, the rewrite rules describe the transformations one wants to operate and rewriting strategies are used to con- trol their application. The operational semantics of these strategies are generally accepted and approaches for analyzing the termination of specific strategies have been studied. We propose in this paper a generic encoding of classic control and traversal strategies used in rewrite based languages such as Maude, Stratego and Tom into a plain term rewriting system. The encoding is proven sound and complete and, as a direct consequence, estab- lished termination methods used for term rewriting systems can be applied to analyze the termination of strategy controlled term rewriting systems. We show that the encoding of strategies into term rewriting systems can be easily adapted to handle many-sorted signa- tures and we use a meta-level representation of terms to reduce the size of the encodings. The corresponding implementation in Tom generates term rewriting systems compatible with the syntax of termination tools such as AProVE and TTT2, tools which turned out to be very effective in (dis)proving the termination of the generated term rewriting systems. The approach can also be seen as a generic strategy compiler which can be integrated into languages providing pattern matching primitives; experiments in Tom show that applying our encoding leads to performances comparable to the native Tom strategies.

Published
2017
Full Text
View/download PDF

3. Pattern Eliminating Transformations

Author

Cirstea, Horatiu, Lermusiaux, Pierre, Moreau, Pierre-Etienne, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, and Fernández, Maribel, editor

Published
2021
Full Text
View/download PDF

4. A Mission Definition, Verification and Validation Architecture

Author

Viard, Louis, Ciarletta, Laurent, Moreau, Pierre-Etienne, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Sekerinski, Emil, editor, Moreira, Nelma, editor, Oliveira, José N., editor, Ratiu, Daniel, editor, Guidotti, Riccardo, editor, Farrell, Marie, editor, Luckcuck, Matt, editor, Marmsoler, Diego, editor, Campos, José, editor, Astarte, Troy, editor, Gonnord, Laure, editor, Cerone, Antonio, editor, Couto, Luis, editor, Dongol, Brijesh, editor, Kutrib, Martin, editor, Monteiro, Pedro, editor, and Delmas, David, editor

Published
2020
Full Text
View/download PDF

6. A Type System for Tom

Author

Kirchner, Claude, Moreau, Pierre-Etienne, and Tavares, Cláudia

Subjects
Computer Science - Logic in Computer Science, Computer Science - Programming Languages
Abstract

Extending a given language with new dedicated features is a general and quite used approach to make the programming language more adapted to problems. Being closer to the application, this leads to less programming flaws and easier maintenance. But of course one would still like to perform program analysis on these kinds of extended languages, in particular type checking and inference. In this case one has to make the typing of the extended features compatible with the ones in the starting language. The Tom programming language is a typical example of such a situation as it consists of an extension of Java that adds pattern matching, more particularly associative pattern matching, and reduction strategies. This paper presents a type system with subtyping for Tom, that is compatible with Java's type system, and that performs both type checking and type inference. We propose an algorithm that checks if all patterns of a Tom program are well-typed. In addition, we propose an algorithm based on equality and subtyping constraints that infers types of variables occurring in a pattern. Both algorithms are exemplified and the proposed type system is showed to be sound and complete.

Published
2010
Full Text
View/download PDF

8. Island Grammar-Based Parsing Using GLL and Tom

Author

Afroozeh, Ali, Bach, Jean-Christophe, van den Brand, Mark, Johnstone, Adrian, Manders, Maarten, Moreau, Pierre-Etienne, Scott, Elizabeth, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Czarnecki, Krzysztof, editor, and Hedin, Görel, editor

Published
2013
Full Text
View/download PDF

9. The Third Rewrite Engines Competition

Author

Durán, Francisco, Roldán, Manuel, Bach, Jean-Christophe, Balland, Emilie, van den Brand, Mark, Cordy, James R., Eker, Steven, Engelen, Luc, de Jonge, Maartje, Kalleberg, Karl Trygve, Kats, Lennart C. L., Moreau, Pierre-Etienne, Visser, Eelco, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Ölveczky, Peter Csaba, editor

Published
2010
Full Text
View/download PDF

10. TomML: A Rule Language for Structured Data

Author

Cirstea, Horatiu, Moreau, Pierre-Etienne, Reilles, Antoine, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Governatori, Guido, editor, Hall, John, editor, and Paschke, Adrian, editor

Published
2009
Full Text
View/download PDF

11. Term-Graph Rewriting Via Explicit Paths

Author

Balland, Emilie, Moreau, Pierre-Etienne, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Voronkov, Andrei, editor

Published
2008
Full Text
View/download PDF

12. Anti-pattern Matching Modulo

Author

Kirchner, Claude, Kopetz, Radu, Moreau, Pierre-Etienne, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Martín-Vide, Carlos, editor, Otto, Friedrich, editor, and Fernau, Henning, editor

Published
2008
Full Text
View/download PDF

13. Towards an Efficient Implementation of Tree Automata Completion

Author

Balland, Emilie, Boichut, Yohan, Genet, Thomas, Moreau, Pierre-Etienne, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Meseguer, José, editor, and Roşu, Grigore, editor

Published
2008
Full Text
View/download PDF

14. Software Quality Improvement Via Pattern Matching

Author

Kopetz, Radu, Moreau, Pierre-Etienne, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Fiadeiro, José Luiz, editor, and Inverardi, Paola, editor

Published
2008
Full Text
View/download PDF

16. Tom: Piggybacking Rewriting on Java

Author

Balland, Emilie, Brauner, Paul, Kopetz, Radu, Moreau, Pierre-Etienne, Reilles, Antoine, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Baader, Franz, editor

Published
2007
Full Text
View/download PDF

17. Anti-pattern Matching

Author

Kirchner, Claude, Kopetz, Radu, Moreau, Pierre-Etienne, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Rangan, C. Pandu, editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and De Nicola, Rocco, editor

Published
2007
Full Text
View/download PDF

18. Formal Islands

Author

Balland, Emilie, Kirchner, Claude, Moreau, Pierre-Etienne, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Johnson, Michael, editor, and Vene, Varmo, editor

Published
2006
Full Text
View/download PDF

19. A Simple Generic Library for C

Author

Vittek, Marian, Borovansky, Peter, Moreau, Pierre-Etienne, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Morisio, Maurizio, editor

Published
2006
Full Text
View/download PDF

25. The Second Rewrite Engines Competition

Author

Durán, Francisco, Roldán, Manuel, Balland, Emilie, van den Brand, Mark, Eker, Steven, Kalleberg, Karl Trygve, Kats, Lennart C.L., Moreau, Pierre-Etienne, Schevchenko, Ruslan, and Visser, Eelco

Published
2009
Full Text
View/download PDF

28. GdR Génie de la Programmation et du Logiciel, Défis 2030

Author

Blay-Fornarino, Mireille, Dubois, Catherine, Moreau, Pierre-Etienne, Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Université Côte d'Azur (UCA), Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE), Proof-oriented development of computer-based systems (MOSEL), Department of Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), and Université Nice Sophia Antipolis (1965 - 2019) (UNS)

Subjects
ACM: D.: Software/D.2: SOFTWARE ENGINEERING, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]
Published
2021

33. Island Grammar-Based Parsing Using GLL and Tom

Author

Afroozeh, Ali, primary, Bach, Jean-Christophe, additional, van den Brand, Mark, additional, Johnstone, Adrian, additional, Manders, Maarten, additional, Moreau, Pierre-Etienne, additional, and Scott, Elizabeth, additional

Published
2013
Full Text
View/download PDF

34. The Third Rewrite Engines Competition

Author

Durán, Francisco, primary, Roldán, Manuel, additional, Bach, Jean-Christophe, additional, Balland, Emilie, additional, van den Brand, Mark, additional, Cordy, James R., additional, Eker, Steven, additional, Engelen, Luc, additional, de Jonge, Maartje, additional, Kalleberg, Karl Trygve, additional, Kats, Lennart C. L., additional, Moreau, Pierre-Etienne, additional, and Visser, Eelco, additional

Published
2010
Full Text
View/download PDF

36. Formal Islands

Author

Balland, Emilie, primary, Kirchner, Claude, additional, and Moreau, Pierre-Etienne, additional

Published
2006
Full Text
View/download PDF

39. Editorial

Author

Danvy, Olivier, Filinski, Andrzej, Giavitto, Jean-Louis, King, Andy, Moreau, Pierre-Etienne, and Talcott, Carolyn

Published
2006

49. Bringing Strategic Rewriting into the Mainstream

Author

Balland, Emilie, Cirstea, Horatiu, Moreau, Pierre-Etienne, Programming Language Technology For Communication Services (Phoenix), Handicap et système nerveux :Action, communication, interaction: rétablissement de la fonction et de la participation [Bordeaux] (EA4136), UFR Sciences médicales 3 [Bordeaux]-Université de Bordeaux Ségalen [Bordeaux 2]-UFR Sciences médicales 3 [Bordeaux]-Université de Bordeaux Ségalen [Bordeaux 2]-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Formal islands: foundations and applications (PAREO), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)-Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Handicap et système nerveux :Action, communication, interaction: rétablissement de la fonction et de la participation [Bordeaux] (EA4136), UFR Sciences médicales 3 [Bordeaux]-Université de Bordeaux Ségalen [Bordeaux 2]-UFR Sciences médicales 3 [Bordeaux]-Université de Bordeaux Ségalen [Bordeaux 2], Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), and Moreau, Pierre-Etienne

Subjects
[INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], pattern matching, strategies, term rewriting, object-oriented programming, tree traversal, [INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL]
Abstract

Developing programming paradigms and languages that ease the program-mers' job of writing quality reusable code have been central ever since the beginning of programming. Tom, the language presented here, has been developed in an attempt to make a step forward in this direction. It promotes term rewriting techniques piggybacked on top of a general-purpose programming language like Java, C, and Python. This results in concise pieces of code which are close to the targeted application domain and which can be reasoned about using effective theoretical and practical tools. This approach has been validated on a variety of concrete applications ranging from academic tools like theorem provers, to large and complex applications, including the Tom compiler itself and several industrial products. This paper presents an overview of the current version of the language and explains the design rationale, browses the application domains and gives some hints on the tool building.

Published
2015

50. A faithful encoding of programmable strategies into term rewriting systems

Author

Cirstea, Horatiu, Lenglet, Serguei, Moreau, Pierre-Etienne, Formal islands: foundations and applications (PAREO), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), and Lenglet, Sergueï

Subjects
000 Computer science, knowledge, general works, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, [INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL], TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], 010201 computation theory & mathematics, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR], Computer Science, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing
Abstract

International audience; Rewriting is a formalism widely used in computer science and mathematical logic. When using rewriting as a programming or modeling paradigm, the rewrite rules describe the transformations one wants to operate and declarative rewriting strategies are used to control their application. The operational semantics of these strategies are generally accepted and approaches for analyzing the termination of specific strategies have been studied. We propose in this paper a generic encoding of classic control and traversal strategies used in rewrite based languages such as Maude, Stratego and Tom into a plain term rewriting system. The encoding is proven sound and complete and, as a direct consequence, established termination methods used for term rewriting systems can be applied to analyze the termination of strategy controlled term rewriting systems. The corresponding implementation in Tom generates term rewriting systems compatible with the syntax of termination tools such as AProVE and TTT2, tools which turned out to be very effective in (dis)proving the termination of the generated term rewriting systems. The approach can also be seen as a generic strategy compiler which can be integrated into languages providing pattern matching primitives; this has been experimented for Tom and performances comparable to the native Tom strategies have been observed. 1998 ACM Subject Classification F.4 Mathematical Logic and Formal Languages

Published
2015
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results