项目作者: mistupv

项目描述 :
A tool for the transformation of an irreversible Term Rewriting System into a reversible one
高级语言: Prolog
项目地址: git://github.com/mistupv/rev-rewriting.git
创建时间: 2016-09-30T08:33:19Z
项目社区:https://github.com/mistupv/rev-rewriting

开源协议:MIT License

下载


Reversible Term Rewriting

A tool written in Prolog for the transformation of an irreversible Term Rewriting System into a reversible one.

Dependencies

This tool uses the tokenize library.
You do not need to install it since it is already included on the project.

How to use

First, load the rules from the rev.pl script as usual:

  1. ?- [rev].

Then, call the main rule (fscd/1) with the path to your .trs file (an atom).

For instance, to use the example TRS AProVE webpage:

  1. ?- fscd('examples/ackermann.trs').

The program will start its execution and print the transformed systems at each step.

Publications

This tool is an implementation of the proposed transformations in the following publications:

  • Naoki Nishida, Adrián Palacios and Germán Vidal. Reversible Term Rewriting. Proceedings of the First International Conference on Formal Structures for Computation and Deduction, 2016, pages 28:1-28:18.

Others

Check this video for the talk about this topic.