@nprofile1q... Let me start off by saying that I'm impressed by Haskell' s type system and I've long been looking for a nice way to express types in Scheme
So I was familiar with the work by Gary Leavens
https://www.cs.ucf.edu/~leavens/ui54/docs/typedscm_toc.htmlor with typed-racket
And I didn't like any of them.
When I started using Kawa, it was the first time when I was really satisfied with a type system for Scheme, at least notation-wise. There are certain capabilities, like - in particular - support for generics, or more advanced type inference, that are missing from that type system. But given that type expressions are potentially macro-expanded, I don't find that to be an urgent problem.
Now, when it comes to your proposal, it doesn't address any of those issues. It doesn't provide type-inference. If I'm getting it right, it is perhaps a slightly more compact notation for a particular use of runtime assertions, but it's still much more verbose than lack of type signatures (that Haskell and ML can boast due to type inference) or what Kawa has to offer.
One advantage that I can see is that it can be used with most Scheme implementations. But it requires me to write code that I wouldn't want to write, and that I don't want to have to write.