A specification language used in the context of an effective theorem prover can provide novel features that enhance precision and expressiveness. In particular, typechecking 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
In this case study we investigate the use of PVS for developing type theoretical concepts and verify...
AbstractIn a previous paper we have defined a semantic preorder called operational subsumption, whic...
In a previous paper we have defined a semantic preorder called operational subsumption, which compar...
The type system of higher-order logic allows to exclude some unexpected expressions such as the appl...
Adding predicate subtyping to higher-order logic yields a very expressive language in which type-che...
TYPES 2020 wasn't held in Turin as planned because of the COVID-19 outbreak.International audienceTh...
Safe programming as well as most proof systems rely on typing. The more a type system is expressive,...
. This paper presents a method for translating a subset of VDM-SL to higher order logic, more specif...
Consider a first order typed language, with semantics $S$ for expressions and types. Adding subtypin...
A specification language is a medium for expressing what is computed rather than how it is computed....
The type system of higher-order logic allows to exclude some unexpected expressions such as the appl...
We present a subtyping extension to the Hindley/Milner type system that is based on name inequivalen...
Many type inference and program analysis systems include notions of subtyping and parametric polymor...
Abstract. A constrained type is a type that comes with a set of subtyping constraints on variables o...
Abstract. Many type inference and program analysis systems include notions of subtyping and parametr...
In this case study we investigate the use of PVS for developing type theoretical concepts and verify...
AbstractIn a previous paper we have defined a semantic preorder called operational subsumption, whic...
In a previous paper we have defined a semantic preorder called operational subsumption, which compar...
The type system of higher-order logic allows to exclude some unexpected expressions such as the appl...
Adding predicate subtyping to higher-order logic yields a very expressive language in which type-che...
TYPES 2020 wasn't held in Turin as planned because of the COVID-19 outbreak.International audienceTh...
Safe programming as well as most proof systems rely on typing. The more a type system is expressive,...
. This paper presents a method for translating a subset of VDM-SL to higher order logic, more specif...
Consider a first order typed language, with semantics $S$ for expressions and types. Adding subtypin...
A specification language is a medium for expressing what is computed rather than how it is computed....
The type system of higher-order logic allows to exclude some unexpected expressions such as the appl...
We present a subtyping extension to the Hindley/Milner type system that is based on name inequivalen...
Many type inference and program analysis systems include notions of subtyping and parametric polymor...
Abstract. A constrained type is a type that comes with a set of subtyping constraints on variables o...
Abstract. Many type inference and program analysis systems include notions of subtyping and parametr...
In this case study we investigate the use of PVS for developing type theoretical concepts and verify...
AbstractIn a previous paper we have defined a semantic preorder called operational subsumption, whic...
In a previous paper we have defined a semantic preorder called operational subsumption, which compar...
DOI
Add to ORKG