Talk:Partition representations: Difference between revisions

Talk:Partition representations (view source)

967 bytes added , 15:34, 28 January 2020

no edit summary

2,954

edits

@@ Line 19: / Line 19: @@
 I see. Go ahead and change it. [[User:Adám Brudzewsky|Adám Brudzewsky]] ([[User talk:Adám Brudzewsky|talk]])
+I meant that match should be taken to ignore prototypes recursively (this is the case in some array languages, such as J). Maybe this is unclear, but "ignoring zero-length divisions" is also unclear: if two partitions differ only in that one has an extra zero-length division at the end, should they be the same?
+Since we're partitioning vectors, only zero-length divisions can be [[empty]]. I've clarified also that a partition can't be empty.
+Part of the problem is that you seem to be using [[prototype]] to mean [[Type]]. The prototype of an array <source lang=apl inline>A</source> has the same structure as <source lang=apl inline>⊃A</source>, so only simple scalars can match their own prototypes. It doesn't make sense to call an array a prototype in isolation: an array has a prototype but no array is a prototype.
+There's no such thing as an "inserted division".
+--[[User:Marshall|Marshall]] ([[User talk:Marshall|talk]]) 15:34, 28 January 2020 (UTC)