Pages that link to "Item:Q2311522"
From MaRDI portal
The following pages link to On an algorithmic algebra over simple-named complex-valued nominative data (Q2311522):
Displaying 14 items.
- Data based algorithmic algebra (Q466367) (← links)
- Set-theoretic analysis of nominative data (Q1650337) (← links)
- Proving properties of programs on hierarchical nominative data (Q1650373) (← links)
- Nominative data with ordered set of names (Q1650383) (← links)
- Implementation of the composition-nominative approach to program formalization in Mizar (Q1650410) (← links)
- Simple-named complex-valued nominative data -- definition and basic operations (Q1688748) (← links)
- Partial correctness of a Fibonacci algorithm (Q2113835) (← links)
- On algebras of algorithms and specifications over uninterpreted data (Q2311521) (← links)
- Partial correctness of a factorial algorithm (Q2337337) (← links)
- Partial correctness of a power algorithm (Q2337338) (← links)
- Properties of semistructed data with multivalued naming and their use (Q2850239) (← links)
- Classes of nominative data with fast access to components (Q2897501) (← links)
- General theory and tools for proving algorithms in nominative data systems (Q6592314) (← links)
- Partial correctness of an algorithm computing Lucas sequences (Q6592315) (← links)