Named parameter pattern matching

I think you’ve mentioned this before but I couldn’t find an issue. I think there’s enough pattern matching that this would eliminate the need for accessors. And it’s pretty easy to translate these into position based pattern matches

Syntax could be:

struct File(name: String, modified_time: Int, size: Int, hash: HashResult)

File(hsh@hash) = file

def time_plus_size(File(mt@modified_time, sze@size)):
  mt + sze

Alternatives to @ could be = or <- or ~

[snoble]

Maybe you could poll some Galiano retreaters

[johnynek]

see https://www.python.org/dev/peps/pep-0622/ for how python is thinking about pattern matching.

I think python would do this as:

match x:
  case Foo(bar = b):