suzanne.soy/racket
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

add enum to list-machine benchmarks

Browse Source
This commit is contained in:
Max New 2014-02-23 11:33:50 -06:00 committed by Robby Findler
parent c237fdfff1
commit eaf71ac6c8
7 changed files with 33 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
pkgs/redex-pkgs/redex-examples/redex/examples/benchmark/list-machine/1.diff
View File

@ -2,18 +2,18 @@
< (define the-error "no error") < (define the-error "no error")
--- ---
> (define the-error "confuses the lhs value for the rhs value in cons type rule") > (define the-error "confuses the lhs value for the rhs value in cons type rule")
112c112,113 113c113,114
< (let ([closure (apply-reduction-relation* < (let ([closure (apply-reduction-relation*
--- ---
> (let* ([stopped #f] > (let* ([stopped #f]
> [closure (apply-reduction-relation* > [closure (apply-reduction-relation*
119c120,122 120c121,123
< (count . > . 1000) < (count . > . 1000)
--- ---
> (count . > . 100) > (count . > . 100)
> (when (count . > . 100) > (when (count . > . 100)
> (set! stopped #t)) > (set! stopped #t))
122,124c125,128 123,125c126,129
< ;; (if the #:stop-when condition is true, we get back an empty list, < ;; (if the #:stop-when condition is true, we get back an empty list,
< ;; and the same thing for a reduction cycle) < ;; and the same thing for a reduction cycle)
< (or (empty? closure) < (or (empty? closure)
@ -22,7 +22,7 @@
> ;; (when the reduction is stopped artificially, the current term is returned) > ;; (when the reduction is stopped artificially, the current term is returned)
> (or stopped > (or stopped
> (empty? closure) > (empty? closure)
225c229 226c230
< [(:lookup-Γ Γ v_0 τ_0) (:lookup-Γ Γ v_1 τ_1) < [(:lookup-Γ Γ v_0 τ_0) (:lookup-Γ Γ v_1 τ_1)
--- ---
> [(:lookup-Γ Γ v_0 τ_0) (:lookup-Γ Γ v_0 τ_1) > [(:lookup-Γ Γ v_0 τ_0) (:lookup-Γ Γ v_0 τ_1)

8
pkgs/redex-pkgs/redex-examples/redex/examples/benchmark/list-machine/2.diff
View File

@ -2,23 +2,23 @@
< (define the-error "no error") < (define the-error "no error")
--- ---
> (define the-error "var-set may skip a var with matching id (in reduction)") > (define the-error "var-set may skip a var with matching id (in reduction)")
43,44c43 44,45c44
< [(where #t (different v v_2)) < [(where #t (different v v_2))
< (var-set r v_2 a_2 r_2) < (var-set r v_2 a_2 r_2)
--- ---
> [(var-set r v_2 a_2 r_2) > [(var-set r v_2 a_2 r_2)
112c111,112 113c112,113
< (let ([closure (apply-reduction-relation* < (let ([closure (apply-reduction-relation*
--- ---
> (let* ([stopped #f] > (let* ([stopped #f]
> [closure (apply-reduction-relation* > [closure (apply-reduction-relation*
119c119,121 120c120,122
< (count . > . 1000) < (count . > . 1000)
--- ---
> (count . > . 20) > (count . > . 20)
> (when (count . > . 20) > (when (count . > . 20)
> (set! stopped #t)) > (set! stopped #t))
121,124c123,128 122,125c124,129
< ;; if reduction terminates in less than 1000 steps, check it ends with halt < ;; if reduction terminates in less than 1000 steps, check it ends with halt
< ;; (if the #:stop-when condition is true, we get back an empty list, < ;; (if the #:stop-when condition is true, we get back an empty list,
< ;; and the same thing for a reduction cycle) < ;; and the same thing for a reduction cycle)

2
pkgs/redex-pkgs/redex-examples/redex/examples/benchmark/list-machine/3.diff
View File

@ -2,7 +2,7 @@
< (define the-error "no error") < (define the-error "no error")
--- ---
> (define the-error "cons doesn't actually update the store") > (define the-error "cons doesn't actually update the store")
78c78 79c79
< (p r_2 ι) < (p r_2 ι)
--- ---
> (p r ι) > (p r ι)

8
pkgs/redex-pkgs/redex-examples/redex/examples/benchmark/list-machine/list-machine-1.rkt
View File

@ -4,7 +4,8 @@
(require redex/reduction-semantics (require redex/reduction-semantics
racket/list racket/list
racket/match) racket/match
math/base)
(provide (all-defined-out)) (provide (all-defined-out))
@ -430,4 +431,7 @@
7) 7)
[`(check-program ,p ,Π) [`(check-program ,p ,Π)
p] p]
[#f #f])) [#f #f]))
(define (generate-enum-term)
(generate-term list-machine-typing (l0 : ι p) #:i-th (random-natural #e10e200)))

8
pkgs/redex-pkgs/redex-examples/redex/examples/benchmark/list-machine/list-machine-2.rkt
View File

@ -4,7 +4,8 @@
(require redex/reduction-semantics (require redex/reduction-semantics
racket/list racket/list
racket/match) racket/match
math/base)
(provide (all-defined-out)) (provide (all-defined-out))
@ -430,4 +431,7 @@
7) 7)
[`(check-program ,p ,Π) [`(check-program ,p ,Π)
p] p]
[#f #f])) [#f #f]))
(define (generate-enum-term)
(generate-term list-machine-typing (l0 : ι p) #:i-th (random-natural #e10e200)))

8
pkgs/redex-pkgs/redex-examples/redex/examples/benchmark/list-machine/list-machine-3.rkt
View File

@ -4,7 +4,8 @@
(require redex/reduction-semantics (require redex/reduction-semantics
racket/list racket/list
racket/match) racket/match
math/base)
(provide (all-defined-out)) (provide (all-defined-out))
@ -426,4 +427,7 @@
7) 7)
[`(check-program ,p ,Π) [`(check-program ,p ,Π)
p] p]
[#f #f])) [#f #f]))
(define (generate-enum-term)
(generate-term list-machine-typing (l0 : ι p) #:i-th (random-natural #e10e200)))

8
pkgs/redex-pkgs/redex-examples/redex/examples/benchmark/list-machine/list-machine-base.rkt
View File

@ -4,7 +4,8 @@
(require redex/reduction-semantics (require redex/reduction-semantics
racket/list racket/list
racket/match) racket/match
math/base)
(provide (all-defined-out)) (provide (all-defined-out))
@ -426,4 +427,7 @@
7) 7)
[`(check-program ,p ,Π) [`(check-program ,p ,Π)
p] p]
[#f #f])) [#f #f]))
(define (generate-enum-term)
(generate-term list-machine-typing (l0 : ι p) #:i-th (random-natural #e10e200)))