Language-agnostic schemas based on Haskell's type system

Re:Language-agnostic schemas based on Haskell's type system by akst on Saturday May 20, 2017 @07:45PM (#14384987)

> It's basically just parametric polymorphism and algebraic data types. They're my two favorite things from Haskell, and both are really simple

As a Haskell programmer I agree on the simplicity point, but you may want to use simpler terms if you're trying to sell someone on simplicity (in reference to parametric polymorphism and algebraic data types)

Cool project though!

[ Parent | on HN ]

Re:Language-agnostic schemas based on Haskell's type system by sjg007 on Saturday May 20, 2017 @09:08PM (#14385232)

So what are the simpler terms? Any examples?

[ Parent | on HN ]

Re:Language-agnostic schemas based on Haskell's type system by akst on Saturday May 20, 2017 @11:19PM (#14385534)

You could probably say Generics instead of Parametric polymorphism, while far less formal a lot more people will grok what you're getting at.

I guess it's not so clear for algebraic data types, but I'd probably refer to swift enums or unions in elm as an example.

Last time I suggested this, someone likened it to intellectualism, lol. I see it more as a communication, a thing that the typed functional community seems to struggle with

[ Parent | on HN ]

Re:Language-agnostic schemas based on Haskell's type system by akst on Sunday May 21, 2017 @10:55AM (#14387575)

Sigh, I cannot edit my comment at this stage, but correction I meant *anti-intellectualism

[ Parent | on HN ]