14 Matching Annotations
1. Jul 2023
2. en.wikipedia.org en.wikipedia.org

#### URL

3. en.wikipedia.org en.wikipedia.org
1. A data model can sometimes be referred to as a data structure, especially in the context of programming languages.

#### URL

4. Nov 2022
5. watermark.silverchair.com watermark.silverchair.com
1. Introduction to Daniel Rosiak's spectacular "Sheaf Theory through Examples" available open access from MIT Direct Press: https://doi.org/10.7551/mitpress/12581.003.0003

#### URL

6. docdrop.org docdrop.org
1. okay so remind you what is a sheath so a sheep is something that allows me to 00:05:37 translate between physical sources or physical realms of data and physical regions so these are various 00:05:49 open sets or translation between them by taking a look at restrictions overlaps 00:06:02 and then inferring

Fixed typos in transcript:

Just generally speaking, what can I do with this sheaf-theoretic data structure that I've got? Okay, [I'll] remind you what is a sheaf. A sheaf is something that allows me to translate between physical sources or physical realms of data [in the left diagram] and the data that are associated with those physical regions [in the right diagram]

So these [on the left] are various open sets [an example being] simplices in a [simplicial complex which is an example of a] topological space.

And these [on the right] are the data spaces and I'm able to make some translation between [the left and the right diagrams] by taking a look at restrictions of overlaps [a on the left] and inferring back to the union.

So that's what a sheaf is [regarding data structures]. It's something that allows me to make an inference, an inferential machine.

#### URL

7. Mar 2021
8. github.com github.com

#### URL

9. Feb 2021
10. en.wikipedia.org en.wikipedia.org
1. Purely functional data structures are persistent. Persistency is required for functional programming; without it, the same computation could return different results.

#### URL

11. Jan 2021
12. doc.rust-lang.org doc.rust-lang.org
1. We could change the definition of Cons to hold references instead, but then we would have to specify lifetime parameters. By specifying lifetime parameters, we would be specifying that every element in the list will live at least as long as the entire list. The borrow checker wouldn’t let us compile let a = Cons(10, &Nil); for example, because the temporary Nil value would be dropped before a could take a reference to it.

#### URL

13. Aug 2020
14. en.wikipedia.org en.wikipedia.org
1. In graph theory, a tree is a connected acyclic graph; unless stated otherwise, in graph theory trees and graphs are assumed undirected. There is no one-to-one correspondence between such trees and trees as data structure.

#### URL

15. Jul 2020
16. github.com github.com

#### URL

17. Apr 2020
18. en.wikipedia.org en.wikipedia.org

#### URL

19. en.wikipedia.org en.wikipedia.org

#### URL

20. en.wikipedia.org en.wikipedia.org

#### URL

21. en.wikipedia.org en.wikipedia.org

#### URL

22. Jun 2017
23. mhbeals.com mhbeals.com
1. Yet, for all the seeming convenience of Microsoft Excel (and its ilk), we pay a hefty price — our time and sanity. “Hyperbole!” I hear you shout. “Nonsense!” I hear you cry. And, when these initial protestations fade, we are left with the ever popular: “I have a system.”