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

adjust let-poly check functions so they count exns as failure,

Browse Source 
but only for the bugs that are expected to show up that way
This commit is contained in:
Robby Findler 2014-03-30 10:15:55 -05:00
parent 6e29bdad31
commit 33fa2f8654
4 changed files with 84 additions and 38 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

32
pkgs/redex-pkgs/redex-examples/redex/examples/benchmark/let-poly/5.diff
View File

@ -10,9 +10,33 @@
> (τ (eliminate-τ x τ σ) (eliminate-G x τ G))]
> [(eliminate-G x τ (y σ G))
> (y (eliminate-τ x τ σ) (eliminate-G x τ G))])
571a574,578
560,571c562,577
< (let ([t-type (type-check M)])
< (implies
< t-type
< (let loop ([Σ+M `(· ,M)])
< (define new-type (type-check (list-ref Σ+M 1) (list-ref Σ+M 0)))
< (and (consistent-with? t-type new-type)
< (or (v? (list-ref Σ+M 1))
< (let ([red-res (apply-reduction-relation red Σ+M)])
< (and (= (length red-res) 1)
< (let ([red-t (car red-res)])
< (or (equal? red-t "error")
< (loop red-t))))))))))))
---
> (with-handlers ([exn:fail? (λ (x) #f)])
> (let ([t-type (type-check M)])
> (implies
> t-type
> (let loop ([Σ+M `(· ,M)])
> (define new-type (type-check (list-ref Σ+M 1) (list-ref Σ+M 0)))
> (and (consistent-with? t-type new-type)
> (or (v? (list-ref Σ+M 1))
> (let ([red-res (apply-reduction-relation red Σ+M)])
> (and (= (length red-res) 1)
> (let ([red-t (car red-res)])
> (or (equal? red-t "error")
> (loop red-t)))))))))))))
>
> (define small-counter-example (term (cons 1)))
> (test-equal (with-handlers ([exn:fail? (λ (x) #f)])
> (check small-counter-example))
> #f)
> (test-equal (check small-counter-example) #f)

32
pkgs/redex-pkgs/redex-examples/redex/examples/benchmark/let-poly/6.diff
View File

@ -6,9 +6,33 @@
< [(∨ boolean_1 boolean_2) #t])
---
> [(∨ boolean boolean) #t])
571a572,576
560,571c560,575
< (let ([t-type (type-check M)])
< (implies
< t-type
< (let loop ([Σ+M `(· ,M)])
< (define new-type (type-check (list-ref Σ+M 1) (list-ref Σ+M 0)))
< (and (consistent-with? t-type new-type)
< (or (v? (list-ref Σ+M 1))
< (let ([red-res (apply-reduction-relation red Σ+M)])
< (and (= (length red-res) 1)
< (let ([red-t (car red-res)])
< (or (equal? red-t "error")
< (loop red-t))))))))))))
---
> (with-handlers ([exn:fail? (λ (x) #f)])
> (let ([t-type (type-check M)])
> (implies
> t-type
> (let loop ([Σ+M `(· ,M)])
> (define new-type (type-check (list-ref Σ+M 1) (list-ref Σ+M 0)))
> (and (consistent-with? t-type new-type)
> (or (v? (list-ref Σ+M 1))
> (let ([red-res (apply-reduction-relation red Σ+M)])
> (and (= (length red-res) 1)
> (let ([red-t (car red-res)])
> (or (equal? red-t "error")
> (loop red-t)))))))))))))
>
> (define small-counter-example (term ((λ x x) 1)))
> (test-equal (with-handlers ([exn:fail? (λ (x) #f)])
> (check small-counter-example))
> #f)
> (test-equal (check small-counter-example) #f)

29
pkgs/redex-pkgs/redex-examples/redex/examples/benchmark/let-poly/let-poly-5.rkt
View File

@ -559,20 +559,19 @@ from the given term.
(define (check M)
(or (not M)
(let ([t-type (type-check M)])
(implies
t-type
(let loop ([Σ+M `(· ,M)])
(define new-type (type-check (list-ref Σ+M 1) (list-ref Σ+M 0)))
(and (consistent-with? t-type new-type)
(or (v? (list-ref Σ+M 1))
(let ([red-res (apply-reduction-relation red Σ+M)])
(and (= (length red-res) 1)
(let ([red-t (car red-res)])
(or (equal? red-t "error")
(loop red-t))))))))))))
(with-handlers ([exn:fail? (λ (x) #f)])
(let ([t-type (type-check M)])
(implies
t-type
(let loop ([Σ+M `(· ,M)])
(define new-type (type-check (list-ref Σ+M 1) (list-ref Σ+M 0)))
(and (consistent-with? t-type new-type)
(or (v? (list-ref Σ+M 1))
(let ([red-res (apply-reduction-relation red Σ+M)])
(and (= (length red-res) 1)
(let ([red-t (car red-res)])
(or (equal? red-t "error")
(loop red-t)))))))))))))
(define small-counter-example (term (cons 1)))
(test-equal (with-handlers ([exn:fail? (λ (x) #f)])
(check small-counter-example))
#f)
(test-equal (check small-counter-example) #f)

29
pkgs/redex-pkgs/redex-examples/redex/examples/benchmark/let-poly/let-poly-6.rkt
View File

@ -557,20 +557,19 @@ from the given term.
(define (check M)
(or (not M)
(let ([t-type (type-check M)])
(implies
t-type
(let loop ([Σ+M `(· ,M)])
(define new-type (type-check (list-ref Σ+M 1) (list-ref Σ+M 0)))
(and (consistent-with? t-type new-type)
(or (v? (list-ref Σ+M 1))
(let ([red-res (apply-reduction-relation red Σ+M)])
(and (= (length red-res) 1)
(let ([red-t (car red-res)])
(or (equal? red-t "error")
(loop red-t))))))))))))
(with-handlers ([exn:fail? (λ (x) #f)])
(let ([t-type (type-check M)])
(implies
t-type
(let loop ([Σ+M `(· ,M)])
(define new-type (type-check (list-ref Σ+M 1) (list-ref Σ+M 0)))
(and (consistent-with? t-type new-type)
(or (v? (list-ref Σ+M 1))
(let ([red-res (apply-reduction-relation red Σ+M)])
(and (= (length red-res) 1)
(let ([red-t (car red-res)])
(or (equal? red-t "error")
(loop red-t)))))))))))))
(define small-counter-example (term ((λ x x) 1)))
(test-equal (with-handlers ([exn:fail? (λ (x) #f)])
(check small-counter-example))
#f)
(test-equal (check small-counter-example) #f)