Semantic subtyping with an SMT solver
From MaRDI portal
Recommendations
Cites work
- A syntactic approach to type soundness
- Deciding validity in a spatial logic for trees
- Dependent types with subtyping and late-bound overloading
- Efficient execution in an automated reasoning environment
- scientific article; zbMATH DE number 3936465 (Why is no real title available?)
- Principles of programming with complex objects and collection types
- Semantic subtyping with an SMT solver
- Semantic subtyping, dealing set-theoretically with function, union, intersection, and negation types
- Simplify: a theorem prover for program checking
- Symbolic execution and program testing
- Termination of nested and mutually recursive algorithms
- Translating higher-order clauses to first-order clauses
Cited in
(6)
This page was built for publication: Semantic subtyping with an SMT solver
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913944)