racket/collects/redex/examples/compatible-closure.ss
2008-08-05 21:09:02 +00:00

18 lines
279 B
Scheme

#lang scheme
(require redex)
(define-language grammar
(B t
f
(B * B)))
(define r
(reduction-relation
grammar
(--> (f * B_1) B_1 false) ; [a]
(--> (t * B_1) t true))) ; [b]
(define ->r (compatible-closure r grammar B))
(traces ->r '((f * f) * (t * f)))