-
`walrus` is basically an abandoned project, `wasmparser` could be a better approach to migrate to using, especially as new versions of Wasm come out with new features that may have events we want to i…
-
#### Is your feature request related to a problem? Please describe.
I would like the ability to delete, edit, or replace samples that have already been commited to a long-term storage in these cas…
-
Conditional Term Rewriting (CTR) is a general methodology in symbolic computing. CTR sets Mathematica apart from being _just_ a Computer-Algebra System (CAS). It is the technology behind metaprogrammi…
-
Hi! I liked your video about term rewriting with prolog. This made me curious if it's possible to do term rewriting *on* prolog code. You mentioned "narrowing" in passing which lead me to some interes…
-
This issue is a reminder that there should be a more careful choice of term ordering in support of permutative rewriting.
PR GaloisInc/saw-core#173 adds very preliminary support for rewriting with …
-
The following program emits undefined warnings when loading:
```prolog
:- meta_predicate test(1).
test :- test([a(_)]).
test(Goal_1) :- call(Goal_1, b).
```
These are the warnings:
``…
-
I took an example from the Nim Manual's TRM section: https://nim-lang.org/docs/manual.html#term-rewriting-macros
The example is almost as-is except that I added a `debugEcho` so that I know if/when…
-
Could you make this package available on hackage? I'd like to use it in a tool (producing canonical representations for a TRS) I'm writing.
int-e updated
4 years ago
-
@kovasb has some excellent experiments in https://github.com/kovasb/combinator on how to do very fast term rewriting in clj/cljs, 2-3x faster than Mathematica is able to support. @littleredcomputer , …
-
This code:
```nim
template rewriteMinusOne{(a = a + 1)|(a += 1)}[T](a: T): untyped =
a -= T(1)
var a = 3
a = a + 1
echo a
a += 1
echo a
```
crashes the compiler. Traceback:
```nim
n…