A specification language used in the context of an effective theorem prover can provide novel features that enhance precision and expressiveness. In particular, type checking for the language can exploit the services of the theorem prover. We describe a feature called "predicate subtyping" that uses this capability and illustrate its utility as mechanized in PVS.
No takes yet. Share an insight, caveat, or question.
Rushby et al. (1998) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: