Pages that link to "Item:Q1688748"
From MaRDI portal
The following pages link to Simple-named complex-valued nominative data -- definition and basic operations (Q1688748):
Displaying 17 items.
- 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)
- Simple-named complex-valued nominative data -- definition and basic operations (Q1688748) (← links)
- Kleene algebra of partial predicates (Q1796766) (← links)
- Partial correctness of a Fibonacci algorithm (Q2113835) (← links)
- On algebras of algorithms and specifications over uninterpreted data (Q2311521) (← links)
- On an algorithmic algebra over simple-named complex-valued nominative data (Q2311522) (← links)
- An inference system of an extension of Floyd-Hoare logic for partial predicates (Q2311523) (← links)
- Partial correctness of GCD algorithm (Q2311524) (← links)
- Partial correctness of a factorial algorithm (Q2337337) (← links)
- Partial correctness of a power algorithm (Q2337338) (← links)
- Computability of functions over metanominative data (Q2745196) (← 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)