ho-rewriting: Generic rewrite rules with safe treatment of variables and binders
This package gives a generic implementation of higher-order rewriting. The main idea is to use techniques from embedded domain-specific languages to offer an interface which is both safe and syntactically appealing.
Some examples are found in the examples
directory. For
more information, see
"Lightweight Higher-Order Rewriting in Haskell" (presented at TFP 2015):
Paper: https://emilaxelsson.github.io/documents/axelsson2015lightweight.pdf
Slides: https://emilaxelsson.github.io/documents/axelsson2015lightweight_slides.pdf
[Skip to Readme]
Modules
- Data
- Rewriting
- Data.Rewriting.FirstOrder
- Data.Rewriting.HigherOrder
- Data.Rewriting.Rules
- Rewriting
Downloads
- ho-rewriting-0.2.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
Versions [RSS] | 0.1, 0.2, 0.2.1 |
---|---|
Dependencies | base (>=4.7 && <5), compdata (>=0.10 && <0.11), containers, mtl, patch-combinators [details] |
License | BSD-3-Clause |
Copyright | Copyright (c) 2015, Emil Axelsson |
Author | Emil Axelsson |
Maintainer | 78emil@gmail.com |
Category | Language |
Home page | https://github.com/emilaxelsson/ho-rewriting |
Bug tracker | https://github.com/emilaxelsson/ho-rewriting/issues |
Source repo | head: git clone https://github.com/emilaxelsson/ho-rewriting |
Uploaded | by EmilAxelsson at 2018-08-11T10:55:04Z |
Distributions | |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Downloads | 2302 total (5 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs not available [build log] All reported builds failed as of 2018-08-11 [all 2 reports] |