Term rewriting systems .net framework
[EN] This thesis presents the implementation of a framework to work with term rewriting systems. Term rewriting systems provide a complete computational model which is very close to functional programming. Its formulation is equational logic and it can also be used to reason about program properties...
| Author: | |
|---|---|
| Format: | master thesis |
| Publication Date: | 2013 |
| Country: | España |
| Institution: | Universitat Politècnica de València (UPV) |
| Repository: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Language: | English |
| OAI Identifier: | oai:riunet.upv.es:10251/44323 |
| Online Access: | https://riunet.upv.es/handle/10251/44323 |
| Access Level: | Open access |
| Keyword: | SRT Confluencia Terminación Sistemas de Reescritura de Termino TRS Confluence Terminating Term Rewriting Systems Termination LENGUAJES Y SISTEMAS INFORMATICOS Máster Universitario en Ingeniería del Software, Métodos Formales y Sistemas de Información-Màster Universitari en Enginyeria del Programari, Mètodes Formals i Sistemes D&apos Informació |
| Summary: | [EN] This thesis presents the implementation of a framework to work with term rewriting systems. Term rewriting systems provide a complete computational model which is very close to functional programming. Its formulation is equational logic and it can also be used to reason about program properties, not only of functional programs but also of programs written in other programming languages. Our framework has been implemented in a tool called TRS.Tool (built on .Net and available at http://TRS.JarCode.Net) that covers three main objectives: - Determine the basic properties of a given term rewriting system (signature, set of rules conservativeness, linearity, etc…). - Calculate the critical pairs of the term rewriting system and determine its orthogonality. - Apply the rewriting rules over a given term. The tool is available as a web based application created using this framework |
|---|