System ST toward a type system for extraction and proofs of programs Original Research Article

We introduce a new type system called “System ST” (ST stands for subtyping), based on subtyping, and prove the basic property of the system. We show the extraordinary expressive power of the system which leads us to think that it could be a good candidate for doing both proof and extraction of programs.