Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

System ST

Raffalli Ch.

Schedae Informaticae

2003

Vol. 12

97-111

This article is a set of commented slides presenting a new type system: "System ST" (ST stands for SubTyping), based on subtyping. The extraordinary expressive power of the system (not really visible in this set of slides) leads us to think that it could be a good candidate for doing both proofs and extractions of programs. The main argument to support this claim is the completeness of the system which says that if a program can be proved correct (using realizability), then it can be extracted from a proof.