b4a4c174e4
Adds intersection types as a better way to handle the the case when restrict cannot structurally intersect two types (e.g. when you learn within a polymorphic function a variable x of type A is also an Integer, but we dont know how A relates to Integer). This allows for non-lossy refinements of type info while typechecking.
389 lines
17 KiB
Racket
389 lines
17 KiB
Racket
#lang racket/base
|
|
|
|
(require "test-utils.rkt"
|
|
(types subtype numeric-tower union utils abbrev)
|
|
(rep type-rep)
|
|
(env init-envs type-env-structs)
|
|
rackunit
|
|
(for-syntax racket/base))
|
|
|
|
(provide tests)
|
|
(gen-test-main)
|
|
|
|
(define-syntax (subtyping-tests stx)
|
|
(define (single-test stx)
|
|
(syntax-case stx (FAIL)
|
|
[(FAIL t s) (syntax/loc stx (test-check (format "FAIL ~a" '(t s)) (lambda (a b) (not (subtype a b))) t s))]
|
|
[(t s) (syntax/loc stx (test-check (format "~a" '(t s)) subtype t s))]))
|
|
(syntax-case stx ()
|
|
[(_ cl ...)
|
|
(with-syntax ([(new-cl ...) (map single-test (syntax->list #'(cl ...)))])
|
|
(syntax/loc stx
|
|
(begin (test-suite "Tests for subtyping"
|
|
new-cl ...))))]))
|
|
|
|
|
|
|
|
(define t1 (-mu T (-lst (Un (-v a) T))))
|
|
(define t2 (unfold t1))
|
|
|
|
(define tests
|
|
(subtyping-tests
|
|
;; trivial examples
|
|
(Univ Univ)
|
|
(-Number Univ)
|
|
(-Boolean Univ)
|
|
(-Symbol Univ)
|
|
(-Void Univ)
|
|
[-Number -Number]
|
|
[(Un (-pair Univ (-lst Univ)) -Null) (-lst Univ)]
|
|
[(-lst* -Number -Number (-val 'foo)) (-lst Univ)]
|
|
[(-lst* -Number -Number (-val 'foo)) (-lst (Un -Number -Symbol))]
|
|
[(-pair (-val 6) (-val 6)) (-pair -Number -Number)]
|
|
[(-val 6) (-val 6)]
|
|
;; unions
|
|
[(Un -Number) -Number]
|
|
[(Un -Number -Number) -Number]
|
|
[(Un -Number -Symbol) (Un -Symbol -Number)]
|
|
[(Un (-val 6) (-val 7)) -Number]
|
|
[(Un (-val #f) (Un (-val 6) (-val 7))) (Un -Number (Un -Boolean -Symbol))]
|
|
[(Un (-val #f) (Un (-val 6) (-val 7))) (-mu x (Un -Number (Un -Boolean -Symbol)))]
|
|
[(Un -Number (-val #f) (-mu x (Un -Number -Symbol (make-Listof x))))
|
|
(-mu x (Un -Number -Symbol -Boolean (make-Listof x)))]
|
|
;; intersections
|
|
[(-unsafe-intersect -Number) -Number]
|
|
[(-unsafe-intersect -Number -Symbol) -Number]
|
|
[(-unsafe-intersect -Boolean -Number) -Number]
|
|
[(-unsafe-intersect -Number -Number) -Number]
|
|
[FAIL -Number (-unsafe-intersect -Boolean -Number)]
|
|
[(-unsafe-intersect -Boolean -Number) (-unsafe-intersect -Boolean -Number)]
|
|
[(-unsafe-intersect -Sexp
|
|
(Un -Null (-pair -Sexp (-unsafe-intersect (make-Listof Univ) -Sexp))))
|
|
(make-Listof Univ)]
|
|
;; sexps vs list*s of nums
|
|
[(-mu x (Un -Number -Symbol (make-Listof x))) (-mu x (Un -Number -Symbol -Boolean (make-Listof x)))]
|
|
[(-mu x (Un -Number (make-Listof x))) (-mu x (Un -Number -Symbol (make-Listof x)))]
|
|
[(-mu x (Un -Number (make-Listof x))) (-mu y (Un -Number -Symbol (make-Listof y)))]
|
|
;; a hard one
|
|
[(-mu x (Un -Number (-lst* x -Symbol x))) -Sexp]
|
|
[t1 (unfold t1)]
|
|
[(unfold t1) t1]
|
|
;; simple function types
|
|
((Univ . -> . -Number) (-Number . -> . Univ))
|
|
[(Univ Univ Univ . -> . -Number) (Univ Univ -Number . -> . -Number)]
|
|
;; simple list types
|
|
[(make-Listof -Number) (make-Listof Univ)]
|
|
[(make-Listof -Number) (make-Listof -Number)]
|
|
[FAIL (make-Listof -Number) (make-Listof -Symbol)]
|
|
[(-mu x (make-Listof x)) (-mu x* (make-Listof x*))]
|
|
[(-pair -Number -Number) (-pair Univ -Number)]
|
|
[(-pair -Number -Number) (-pair -Number -Number)]
|
|
;; from page 7
|
|
[(-mu t (-> t t)) (-mu s (-> s s))]
|
|
[(-mu s (-> -Number s)) (-mu t (-> -Number (-> -Number t)))]
|
|
;; polymorphic types
|
|
[(-poly (t) (-> t t)) (-poly (s) (-> s s))]
|
|
[FAIL (make-Listof -Number) (-poly (t) (make-Listof t))]
|
|
[(-poly (a) (make-Listof (-v a))) (make-Listof -Number)] ;;
|
|
[(-poly (a) -Number) -Number]
|
|
|
|
[(-val 6) -Number]
|
|
[(-val 'hello) -Symbol]
|
|
[(-set -Number) (make-Sequence (list -Number))]
|
|
[-FlVector (make-Sequence (list -Flonum))]
|
|
[-FlVector (make-Sequence (list -Number))]
|
|
[-FxVector (make-Sequence (list -Fixnum))]
|
|
[-FxVector (make-Sequence (list -Number))]
|
|
[((Un -Symbol -Number) . -> . -Number) (-> -Number -Number)]
|
|
[(-poly (t) (-> -Number t)) (-mu t (-> -Number t))]
|
|
;; not subtypes
|
|
[FAIL (-val 'hello) -Number]
|
|
[FAIL (-val #f) -Symbol]
|
|
[FAIL (Univ Univ -Number -Number . -> . -Number) (Univ Univ Univ . -> . -Number)]
|
|
[FAIL (-Number . -> . -Number) (-> Univ Univ)]
|
|
[FAIL (Un -Number -Symbol) -Number]
|
|
[FAIL -Number (Un (-val 6) (-val 11))]
|
|
[FAIL -Symbol (-val 'Sym)]
|
|
[FAIL (Un -Symbol -Number) (-poly (a) -Number)]
|
|
;; bugs found
|
|
[(Un (-val 'foo) (-val 6)) (Un (-val 'foo) (-val 6))]
|
|
[(-poly (a) (make-Listof (-v a))) (make-Listof (-mu x (Un (make-Listof x) -Number)))]
|
|
[FAIL (make-Listof (-mu x (Un (make-Listof x) -Number))) (-poly (a) (make-Listof a))]
|
|
[(-val -34.2f0) -NegSingleFlonum]
|
|
;; case-lambda
|
|
[(cl-> [(-Number) -Number] [(-Boolean) -Boolean]) (-Number . -> . -Number)]
|
|
;; special case for unused variables
|
|
[-Number (-poly (a) -Number)]
|
|
[FAIL (cl-> [(-Number) -Boolean] [(-Boolean) -Number]) (-Number . -> . -Number)]
|
|
;; varargs
|
|
[(->* (list -Number) Univ -Boolean) (->* (list -Number) -Number -Boolean)]
|
|
[(->* (list Univ) -Number -Boolean) (->* (list -Number) -Number -Boolean)]
|
|
[(->* (list -Number) -Number -Boolean) (->* (list -Number) -Number -Boolean)]
|
|
[(->* (list -Number) -Number -Boolean) (->* (list -Number) -Number Univ)]
|
|
[(->* (list -Number) -Number -Number) (->* (list -Number -Number) -Number)]
|
|
[(->* (list -Number) -Number -Number) (->* (list -Number -Number -Number) -Number)]
|
|
[(->* (list -Number -Number) -Boolean -Number) (->* (list -Number -Number) -Number)]
|
|
[FAIL (->* (list -Number) -Number -Boolean) (->* (list -Number -Number -Number) -Number)]
|
|
[(->* (list -Number -Number) -Boolean -Number) (->* (list -Number -Number -Boolean -Boolean) -Number)]
|
|
|
|
[(-poly (a) (cl-> [() a]
|
|
[(-Number) a]))
|
|
(cl-> [() (-pair -Number (-v b))]
|
|
[(-Number) (-pair -Number (-v b))])]
|
|
|
|
[(-values (list -Number)) (-values (list Univ))]
|
|
|
|
[(-poly (b) ((Un (make-Base 'foo #'dummy values #f)
|
|
(-struct #'bar #f
|
|
(list (make-fld -Number #'values #f) (make-fld b #'values #f))))
|
|
. -> . (-lst b)))
|
|
((Un (make-Base 'foo #'dummy values #f) (-struct #'bar #f (list (make-fld -Number #'values #f) (make-fld (-pair -Number (-v a)) #'values #f))))
|
|
. -> . (-lst (-pair -Number (-v a))))]
|
|
[(-poly (b) ((-struct #'bar #f (list (make-fld -Number #'values #f) (make-fld b #'values #f))) . -> . (-lst b)))
|
|
((-struct #'bar #f (list (make-fld -Number #'values #f) (make-fld (-pair -Number (-v a)) #'values #f))) . -> . (-lst (-pair -Number (-v a))))]
|
|
|
|
[(-poly (a) (a . -> . (make-Listof a))) ((-v b) . -> . (make-Listof (-v b)))]
|
|
[(-poly (a) (a . -> . (make-Listof a))) ((-pair -Number (-v b)) . -> . (make-Listof (-pair -Number (-v b))))]
|
|
|
|
[FAIL (-poly (a b) (-> a a)) (-poly (a b) (-> a b))]
|
|
[FAIL (-poly (a) (-poly (b) (-pair a b))) (-poly (a) (-poly (b) (-pair b a)))]
|
|
|
|
;; The following currently are not subtypes, because they are not replacable
|
|
;; in an instantiation context. It may be sound for them to be subtypes but
|
|
;; the implications of that change are unknown.
|
|
[FAIL (-poly (x) (-lst x)) (-poly (x y) (-lst x))]
|
|
[FAIL (-poly (y z) (-lst y)) (-poly (z y) (-lst y))]
|
|
[FAIL (-poly (y) (-poly (z) (-pair y z))) (-poly (y z) (-pair y z))]
|
|
[FAIL (-poly (y z) (-pair y z)) (-poly (y) (-poly (z) (-pair y z)))]
|
|
|
|
|
|
;; polymorphic function types should be subtypes of the function top
|
|
[(-poly (a) (a . -> . a)) top-func]
|
|
(FAIL (-> Univ) (null Univ . ->* . Univ))
|
|
|
|
[(cl->* (-Number . -> . -String) (-Boolean . -> . -String)) ((Un -Boolean -Number) . -> . -String)]
|
|
[(-struct #'a #f null) (-struct #'a #f null)]
|
|
[(-struct #'a #f (list (make-fld -String #'values #f))) (-struct #'a #f (list (make-fld -String #'values #f)))]
|
|
[(-struct #'a #f (list (make-fld -String #'values #f))) (-struct #'a #f (list (make-fld Univ #'values #f)))]
|
|
[(-val 0.0f0) -SingleFlonum]
|
|
[(-val -0.0f0) -SingleFlonum]
|
|
[(-val 1.0f0) -SingleFlonum]
|
|
[(-pair -String (-lst -String)) (-seq -String)]
|
|
[FAIL (-pair -String (-lst -Symbol)) (-seq -String)]
|
|
[FAIL (-pair -String (-vec -String)) (-seq -String)]
|
|
[(-mpair -String (-mlst -String)) (-seq -String)]
|
|
[FAIL (-mpair -String (-mlst -Symbol)) (-seq -String)]
|
|
[FAIL (-mpair -String (-vec -String)) (-seq -String)]
|
|
[(-mpair -String (-mlst (-val "hello"))) (-seq -String)]
|
|
|
|
[(-Param -Byte -Byte) (-Param (-val 0) -Int)]
|
|
[FAIL (-Param -Byte -Byte) (-Param -Int -Int)]
|
|
[(-Param -String -Symbol) (cl->* (-> -Symbol) (-> -String -Void))]
|
|
|
|
[(-vec t1) (-vec t2)]
|
|
[(make-HeterogeneousVector (list t1)) (-vec t2)]
|
|
[(make-HeterogeneousVector (list t1 t2)) (make-HeterogeneousVector (list t2 t1))]
|
|
[(-box t1) (-box t2)]
|
|
[(-thread-cell t1) (-thread-cell t2)]
|
|
[(-channel t1) (-channel t2)]
|
|
[(-mpair t1 t2) (-mpair t2 t1)]
|
|
[(-HT t1 t2) (-HT t2 t1)]
|
|
[(make-Prompt-Tagof t1 t2) (make-Prompt-Tagof t2 t1)]
|
|
[(make-Continuation-Mark-Keyof t1) (make-Continuation-Mark-Keyof t2)]
|
|
|
|
;; evts
|
|
[(-evt t1) (-evt t2)]
|
|
[FAIL (-evt -Byte) (-evt -String)]
|
|
[-Semaphore (-evt -Semaphore)]
|
|
[FAIL -Semaphore (-evt -Int)]
|
|
[-Output-Port (-evt -Output-Port)]
|
|
[FAIL -Output-Port (-evt -Int)]
|
|
[-Input-Port (-evt -Input-Port)]
|
|
[FAIL -Input-Port (-evt -Int)]
|
|
[-TCP-Listener (-evt -TCP-Listener)]
|
|
[FAIL -TCP-Listener (-evt -Int)]
|
|
[-Thread (-evt -Thread)]
|
|
[FAIL -Thread (-evt -Int)]
|
|
[-Subprocess (-evt -Subprocess)]
|
|
[FAIL -Subprocess (-evt -Int)]
|
|
[-Will-Executor (-evt -Will-Executor)]
|
|
[FAIL -Will-Executor (-evt -Int)]
|
|
[(make-CustodianBox -String) (-evt (make-CustodianBox -String))]
|
|
[FAIL (make-CustodianBox -String) (-evt -String)]
|
|
[(-channel -String) (-evt -String)]
|
|
[FAIL (-channel -String) (-evt -Int)]
|
|
[-Log-Receiver (-evt (make-HeterogeneousVector
|
|
(list -Symbol -String Univ
|
|
(Un (-val #f) -Symbol))))]
|
|
[FAIL -Log-Receiver (-evt -Int)]
|
|
|
|
[(-val 5) (-seq -Nat)]
|
|
[(-val 5) (-seq -Byte)]
|
|
[-Index (-seq -Index)]
|
|
[-NonNegFixnum (-seq -NonNegFixnum)]
|
|
[-Index (-seq -Nat)]
|
|
[FAIL (-val -5) (-seq -Nat)]
|
|
[FAIL -Fixnum (-seq -Fixnum)]
|
|
[FAIL -NonNegFixnum (-seq -Index)]
|
|
[FAIL (-val 5.0) (-seq -Nat)]
|
|
|
|
[(-polydots (a) (->... (list Univ) (a a) (make-ValuesDots null a 'a)))
|
|
(-polydots (a) (->... (list -String) (a a) (make-ValuesDots null a 'a)))]
|
|
|
|
[(-polydots (a) (->... null (Univ a) (make-ValuesDots (list (-result a)) a 'a)))
|
|
(-polydots (a) (->... null (-String a) (make-ValuesDots (list (-result a)) a 'a)))]
|
|
|
|
[(-polydots (a) (->... null (a a) (make-ValuesDots (list (-result -String)) -String 'a)))
|
|
(-polydots (a) (->... null (a a) (make-ValuesDots (list (-result Univ)) Univ 'a)))]
|
|
|
|
[(-polydots (a) (->... null (Univ a) (-values (list Univ))))
|
|
(->* null Univ Univ)]
|
|
|
|
|
|
[(-polydots (a) (->... null (a a) (make-ListDots a 'a)))
|
|
(-> -String -Symbol (-Tuple (list -String -Symbol)))]
|
|
[(-> -String -Symbol (-Tuple (list -String -Symbol)))
|
|
(-polydots (a) (-> -String -Symbol (-lst (Un -String -Symbol))))]
|
|
|
|
[(-polydots (a) (->... null (a a) (make-ListDots a 'a)))
|
|
(-poly (a b) (-> a b (-Tuple (list a b))))]
|
|
|
|
[(-polydots (b a) (-> (->... (list b) (a a) (make-ValuesDots (list (-result b)) a 'a)) Univ))
|
|
(-polydots (a) (-> (->... (list) (a a) (make-ValuesDots null a 'a)) Univ))]
|
|
|
|
[(-polydots (a) (->... (list) (a a) (make-ListDots a 'a)))
|
|
(-polydots (b a) (->... (list b) (a a) (-pair b (make-ListDots a 'a))))]
|
|
|
|
[FAIL
|
|
(-polydots (c a b) (->... (list (->... (list a) (b b) c) (-vec a)) ((-vec b) b) (-vec c)))
|
|
(->* (list (->* (list) -Symbol -Symbol)) (-vec -Symbol) (-vec -Symbol))]
|
|
|
|
[(-> Univ -Boolean : (-PS (-is-type 0 -Symbol) (-not-type 0 -Symbol)))
|
|
(-> Univ -Boolean : -tt-propset)]
|
|
[(-> Univ -Boolean : -ff-propset)
|
|
(-> Univ -Boolean : (-PS (-is-type 0 -Symbol) (-not-type 0 -Symbol)))]
|
|
[(-> Univ -Boolean : (-PS (-is-type 0 -Symbol) (-not-type 0 -Symbol)))
|
|
(-> (Un -Symbol -String) -Boolean : (-PS (-is-type 0 -Symbol) (-not-type 0 -Symbol)))]
|
|
[FAIL
|
|
(-> Univ -Boolean : (-PS (-is-type 0 -Symbol) (-not-type 0 -Symbol)))
|
|
(-> Univ -Boolean : (-PS (-is-type 0 -String) (-not-type 0 -String)))]
|
|
|
|
;; subtyping for types inside propositions
|
|
[(-> Univ -Boolean : (-PS (-is-type 0 -Symbol) (-not-type 0 -Symbol)))
|
|
(-> Univ -Boolean : (-PS (-is-type 0 (-opt -Symbol)) (-not-type 0 -Symbol)))]
|
|
[(-> Univ -Boolean : (-PS (-is-type 0 -Symbol) (-not-type 0 (-opt -Symbol))))
|
|
(-> Univ -Boolean : (-PS (-is-type 0 -Symbol) (-not-type 0 -Symbol)))]
|
|
[FAIL
|
|
(-> Univ -Boolean : (-PS (-is-type 0 (-opt -Symbol)) (-not-type 0 (-opt -Symbol))))
|
|
(-> Univ -Boolean : (-PS (-is-type 0 -Symbol) (-not-type 0 -Symbol)))]
|
|
|
|
[FAIL (make-ListDots (-box (make-F 'a)) 'a) (-lst (-box Univ))]
|
|
[(make-ListDots (-> -Symbol (make-F 'a)) 'a) (-lst (-> -Symbol Univ))]
|
|
|
|
[FAIL (make-ValuesDots (list) -Symbol 'a) (make-ValuesDots (list (-result -String)) -String 'a)]
|
|
[(-values (list -Bottom)) (-values (list -String -Symbol))]
|
|
|
|
[(-> Univ -Bottom) (-> Univ (-values (list -String -Symbol)))]
|
|
[(-> Univ -Bottom) (-> Univ (-values-dots null -String 'x))]
|
|
|
|
[FAIL (make-pred-ty -String) (-> Univ (-AnyValues (-is-type 0 -String)))]
|
|
|
|
;; keyword function types
|
|
[(->key #:x -Symbol #f Univ) (->key Univ)]
|
|
[FAIL (->key #:x -Symbol #t Univ) (->key Univ)]
|
|
[FAIL (->key Univ) (->key #:x -Symbol #t Univ)]
|
|
[(->key #:x -Symbol #f #:y -Symbol #f Univ) (->key Univ)]
|
|
[FAIL (->key #:x -Symbol #f #:y -Symbol #t Univ) (->key Univ)]
|
|
[(->key #:x -Symbol #f #:y -Symbol #f Univ) (->key #:x -Symbol #f Univ)]
|
|
[(->key #:x -Symbol #f #:y -Symbol #f Univ) (->key #:x -Symbol #t Univ)]
|
|
[FAIL (->key #:x -Symbol #f Univ) (->key #:x -Symbol #f #:y -Symbol #f Univ)]
|
|
[(->key #:x -Symbol #f #:y -Symbol #f Univ)
|
|
(->key #:x -Symbol #t #:y -Symbol #t Univ)]
|
|
[FAIL
|
|
(->key #:x -Symbol #t #:y -Symbol #f Univ)
|
|
(->key #:x -Symbol #f #:y -Symbol #t Univ)]
|
|
[(->key #:x (-opt -String) #f #:y -Symbol #f Univ)
|
|
(->key #:x -String #t Univ)]
|
|
[FAIL
|
|
(->key #:x -String #f #:y -Symbol #f Univ)
|
|
(->key #:x (-opt -String) #t Univ)]
|
|
[(->key -String #:x -Symbol #f #:y -Symbol #f Univ)
|
|
(->key -String #:x -Symbol #t Univ)]
|
|
[FAIL
|
|
(->key -String #:x -Symbol #f #:y -Symbol #f Univ)
|
|
(->key -Void #:x -Symbol #t Univ)]
|
|
[(->optkey -String [-String] #:x -Symbol #f #:y -Symbol #f Univ)
|
|
(->key -String #:x -Symbol #t Univ)]
|
|
[(->optkey -String [-String] #:x -Symbol #f #:y -Symbol #f Univ)
|
|
(->optkey -String [-String] #:x -Symbol #t Univ)]
|
|
[FAIL
|
|
(->optkey -String [-String] #:x -Symbol #f #:y -Symbol #f Univ)
|
|
(->optkey -String [-Void] #:x -Symbol #t Univ)]
|
|
[FAIL
|
|
(->key -String #:x -Symbol #f #:y -Symbol #f Univ)
|
|
(->optkey -String [-Void] #:x -Symbol #t Univ)]
|
|
|
|
;; classes and objects
|
|
[(-class #:method ((m (-> -Nat))) #:augment ((m (-> -Nat))))
|
|
(-class #:method ((m (-> -Nat))) #:augment ((m (-> -Nat))))]
|
|
[(-object #:method ((m (-> -Nat))) #:augment ((m (-> -Nat))))
|
|
(-object #:method ((m (-> -Nat))) #:augment ((m (-> -Nat))))]
|
|
[(-object #:method ((m (-> -Nat)) (n (-> -Nat))))
|
|
(-object #:method ((m (-> -Nat))))]
|
|
[(-object #:method ((f (-> -Nat))) #:augment ((m (-> -Nat)) (n (-> -Nat))))
|
|
(-object #:augment ((m (-> -Nat))))]
|
|
[(-object #:field ((a -Nat)) #:method ((m (-> -Nat)) (n (-> -Nat))))
|
|
(-object #:method ((m (-> -Nat))))]
|
|
[(-object #:field ((x -Symbol)))
|
|
(-object #:field ((x -Symbol)))]
|
|
[(-object #:field ((x -Symbol)))
|
|
(-object #:field ((x (Un -Symbol (-val #f)))))]
|
|
[FAIL
|
|
(-object #:field ((a -Symbol)))
|
|
(-object #:field ((x -Symbol)))]
|
|
[FAIL
|
|
(-object #:field ((a -Symbol)))
|
|
(-object #:field ((x -String)))]
|
|
[FAIL
|
|
(-object #:field ((x -Symbol)))
|
|
(-object #:field ((x -String)))]
|
|
[FAIL
|
|
(-object #:method ((m (-> -String)) (n (-> -String))))
|
|
(-object #:method ((x (-> -String))))]
|
|
[(-object #:method ((m (-> -String)) (n (-> -String))))
|
|
(-object #:method ((m (-> -String))))]
|
|
[FAIL
|
|
(-object #:method ())
|
|
(-object #:method ((m (-> -String))))]
|
|
[FAIL
|
|
(-object #:method ((m (-> -Nat)) (n (-> -Nat))))
|
|
(-object #:method ((l (-> -Nat)) (m (-> -Nat))))]
|
|
[(-object #:method ((m (-> -Nat)) (n (-> -Nat))))
|
|
(-object #:method ((n (-> -Nat)) (m (-> -Nat))))]
|
|
[FAIL
|
|
(-class #:method ((m (-> -Nat))))
|
|
(-class #:method ((m (-> -Nat))) #:augment ((m (-> -Nat))))]
|
|
[FAIL
|
|
(-class #:method ((m (-> -Nat))) #:augment ((m (-> -Nat))))
|
|
(-class #:method ((m (-> -Nat))))]
|
|
|
|
;; prefab structs
|
|
[(-prefab 'foo -String) (-prefab 'foo -String)]
|
|
[(-prefab 'foo -String) (-prefab 'foo (-opt -String))]
|
|
[(-prefab '(bar foo 1) -String -Symbol) (-prefab 'foo -String)]
|
|
[(-prefab '(bar foo 1) -String -Symbol) (-prefab 'foo (-opt -String))]
|
|
[FAIL
|
|
(-prefab '(foo #(0)) -String) (-prefab '(foo #(0)) (-opt -String))]
|
|
[(-prefab '(foo 1 #(0)) -String -Symbol)
|
|
(-prefab '(foo #(0)) -String)]
|
|
[(-prefab '(bar foo 1 #(0)) -String -Symbol)
|
|
(-prefab '(foo #(0)) -String)]
|
|
[FAIL
|
|
(-prefab '(foo #()) -String) (-prefab '(foo #(0)) (-opt -String))]
|
|
|
|
;; Proposition subtyping
|
|
((make-pred-ty (list -Real) -Boolean (Un (-val 0.0) (-val 0)))
|
|
(make-pred-ty (list -Int) -Boolean (-val 0)))
|
|
|
|
))
|