by

Where communities thrive


  • Join over 1.5M+ people
  • Join over 100K+ communities
  • Free without limits
  • Create your own community
People
Activity
  • 17:51
    mkeskells synchronize #9102
  • 17:29
    som-snytt commented #10494
  • 16:27
    mkeskells review_requested #9102
  • 16:27
    scala-jenkins milestoned #9102
  • 16:27
    mkeskells opened #9102
  • 15:33
    sasanjoy commented #10494
  • 15:17
    bishabosha synchronize #8865
  • 15:03
    bishabosha synchronize #8865
  • 13:33
    mwielocha synchronize #9101
  • 13:10
    mwielocha synchronize #9101
  • 12:55
    mwielocha commented #9101
  • 12:30
    scala-jenkins milestoned #9101
  • 12:30
    mwielocha opened #9101
  • 12:28
    mwielocha opened #12069
  • 11:13
    mkeskells synchronize #8970
  • 07:21

    lrytz on 2.13.x

    ArrayDeque.alloc doc: do not us… Merge pull request #9099 from u… (compare)

  • 07:21
    lrytz closed #9099
  • 07:18

    lrytz on 2.13.x

    [bug#10131] Stop leaking head i… Merge pull request #9098 from N… (compare)

  • 07:18
    lrytz closed #9098
  • 07:18
    lrytz closed #10131
Fabio Labella
@SystemFw
in what sense?
segeljakt
@segeljakt
compared to a regular List
Martijn Hoekstra
@martijnhoekstra

No command 'sel' found, but there are 18 similar ones

oh, thanks Bash. That's helpful.

Fabio Labella
@SystemFw
@klassegeljakt a heterogenous list
segeljakt
@segeljakt
Ok, compared to a List it preserves type information of each element. Compared to a Tuple, it abstracts over arity
Justin du Coeur, AKA Mark Waks
@jducoeur
Correct.
segeljakt
@segeljakt
is it “arity polymorphic”?
or do you call it something else
Fabio Labella
@SystemFw
it doesn't really abstract over arity on its own
it just happens to have an inductive structure
and one can use typeclasses to "abstract over arity"
But I wouldn't call an HList arity polymorphic, personally
segeljakt
@segeljakt
ok
Seth Tisue
@SethTisue
normally when we say “arity” we’re talking about functions
idk, I guess we say it about tuples
segeljakt
@segeljakt
is it
def foo[<kinds>](<arity>) = …
Seth Tisue
@SethTisue
as Fabio indicates, an HList is really just a series of nested tuples of arity 2
Fabio Labella
@SystemFw
kinds there also doesn't make sense :)
those are type parameters
a kind is a different thing
btw I can explain most of those terms if you want, I just don't want to throw a ton of info at you at once
Ichoran
@Ichoran
Arity just means "how many arguments". It doesn't tell you whether they are type arguments or value arguments.
Or what you pack them into.
segeljakt
@segeljakt
I should not have wrote it like that
1-kind: Foo[A]
2-kind: Foo[A,B]
3-kind: Foo[A,B,C]
…?
Fabio Labella
@SystemFw
ehm, kind of
no pun intended
segeljakt
@segeljakt
lol
Fabio Labella
@SystemFw
your notation is too imprecise
the 1-kind, 2-kind thing
Ichoran
@Ichoran
Mathematical vectors have arity, for instance. v = (a, b) is a 2-ary vector.
segeljakt
@segeljakt
(y)
How would you explain kinds?
Fabio Labella
@SystemFw
it cannot distinguish between Either[A, B] and Free[F, R] (the F there can be IO, not Int, whereas the A in Either can be IO[Int], or String, but not IO)
that's the explanation I use for kinds
first of all, talking about kinds in Scala is a bit weird, the notation is not great
so I'm going to use Haskell notation, which is std, and show you the translation to scala
basically it starts with types
a type is a compile time label that's attached to a term (a term is a value like 1 or "hello" or map), which can be used to statically prove the absence of certain behaviour
Ichoran
@Ichoran
Haskell notation is basically the optimal notation for talking about types, anyway. It's like someone took that notation and built a programming language around it.
Fabio Labella
@SystemFw
or in layman terms, a type is a way of classifying value (but try to understand the definition above, because that's the correct one)
similarly, there are labels to classify types themselves
these labels are called kinds
segeljakt
@segeljakt
types give values meaning?
Fabio Labella
@SystemFw
that's a cool sentence but it doesn't really mean anything :)
traditionally, a kind system is quite simple
Ichoran
@Ichoran
Types just express what you know about a value (which may or may not not be its actual value) without running the program.
Fabio Labella
@SystemFw
by traditionally I mean in SystemFw, or roughly in Haskell, and it's basically a simply typed lambda calculus at the type level. Which means this
imagine there is no subtyping
like in Haskell
Ichoran
@Ichoran
Kinds are a way to classify your types.