As Cory said, “we have to ask ourselves why we're not just directly using arrays everywhere in the first place.“ (Maybe that includes understanding that a regular Z6 is a list containing one string element, but then we have to ask ourselves why typed lists would have a generic type, if the element’s type is not generic.)Assuming that the head-and-tail representation is preferred, is it not the case that the definition (value) of the Z1K1/type for every K2/tail will necessarily be identical, for a given element type? So could we make it a Z2? I’m not sure what type of Z2 (just a Z4?) but substituting its reference (“Zn”) into the canonical form, in place of the tail object’s type, gives:That is the (manual) evaluation of a re-writing function. One could similarly define a function that re-writes an array into this form (or the more explicit canonical form, or the normalized form). Such a function (“Znn”) could give a representation like:That doesn’t look quite right, but you get the idea; it’s rather similar to Option 3, but it avoids changing what it means to be a typed list.Al._______________________________________________On Sat, 2 Apr 2022 at 16:34, Lindsay Wardell <three060@gmail.com> wrote:I really like what I think is Option 3 (Change what it means to be a typed list), ignoring the technical implementation this looks really readable to me for a canonical view:Looking at how one might interact with a typed list, once you access one of the items in the list, they would already know what the type is (in the above example, a Z6/String). To me, the value of a linked list is knowing at a high level what type a list contains, and to validate adding new data to that list.I also really like that this includes the metadata for the type, so that it can be accessed and checked during runtime if needed._______________________________________________On Fri, Apr 1, 2022 at 9:52 PM Denny Vrandečić <dvrandecic@wikimedia.org> wrote:The on-wiki version is available here (and might be much easier to read):_______________________________________________--Today’s newsletter will be focusing on a technical detail, and you should feel free to skip it if you don’t want to dive into the hairy details of our data model.
Over the last few weeks we have repeatedly hit a blocker, and have not yet resolved it, which is how to represent a typed list without the representation becoming very long. A list in Wikifunctions is a type that contains an unknown number of elements in a specific order.
In the Wikifunctions data model, a list is represented the same way as it is in the programming language Lisp: a list consists of two parts, a “head”, which is the first element of the list, and a “tail”, which itself is a list and holds the rest of the list. In addition, there is the empty list, which has no head or tail and represents a list with zero elements. In Wikifunctions, the type for a list is Z10/List.
So a list with two elements
"a"and"b"would, represented in our usual JSON notation, look like this:
As this gets a bit long, we have introduced a shortcut by using JSON’s array notation, and so the list can be represented as follows:
The short notation (we call it canonicalized) can be easily and mechanically translated into the longer notation seen above, and the other way around.
In Phase η we introduced the possibility to have typed lists. Whereas in the normal list we don’t say anything about the type of the elements of the list, in a typed list we say “every element of the list must be of a certain type”. Having typed lists allows us to have stronger guarantees on typing: if you ask for an element of a typed list, you know what type the result will be. This can be helpful with type checking and with providing better interfaces.
A typed list is the result of a function call. We have a function, Z881/Typed list, that takes a type as its sole argument, and returns a type. The resulting type is a copy of Z10/List, with the difference that instead of the head having a value of any type, it must have a value of the type provided as the argument. And the tail is not of type Z10/List, but of the type returned by calling Z881/Type list with the given argument type.
Let’s say we want to represent the list we had before, but instead of it being a Z10/List it should be a list of strings. A list of strings is a type which is created by calling the function Z881/Typed list on the type Z6/String. This would look as follows in JSON notation.
The challenge is that we cannot have the same short notation for this, as we would lose information.
We have tried to work around this by guessing the type: we look into the list, and if everything has the same type, we declare it a typed list. But first, it adds quite a bit of complexity to the code, and second it still does not solve all issues: the short form of the above list could indeed be a list of objects, or it could be a list of strings - there is no way for us to know.
We are publishing our internal discussion and a few options, and we would like to hear your thoughts and gather some wider input.
Abstract-Wikipedia mailing list -- abstract-wikipedia@lists.wikimedia.org
List information: https://lists.wikimedia.org/postorius/lists/abstract-wikipedia.lists.wikimedia.org/
Abstract-Wikipedia mailing list -- abstract-wikipedia@lists.wikimedia.org
List information: https://lists.wikimedia.org/postorius/lists/abstract-wikipedia.lists.wikimedia.org/
Abstract-Wikipedia mailing list -- abstract-wikipedia@lists.wikimedia.org
List information: https://lists.wikimedia.org/postorius/lists/abstract-wikipedia.lists.wikimedia.org/