scientific article; zbMATH DE number 3441605
From MaRDI portal
Publication:4766569
Cited in
(6)- Some questions about expressiveness and relative completeness in Hoare's logic
- Finiteness is mu-ineffable
- Translatability of schemas over restricted interpretations
- Relative complexity of algebras
- Expressive power of typed and type-free programming languages
- Implementation of data types by algebraic methods
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4766569)