Conversation

So… the early work on ADTs (Algebraic Data Types) was originally based on ADTs (Abstract Data Types)! This seems less surprising now that I think about it… I think? 😅

Quote Tweet

Nate Foster

@natefoster

· Jun 14, 2021

Replying to @natefoster @JAldrichPL and @TaliaRinger

For example, here's a nice survey: courses.engr.illinois.edu/cs576/sp2017/r

You’re unable to view this Tweet because this account owner limits who can view their Tweets. Learn more

Brendan Zabarauskas

@brendanzab

Replying to

@lambdakitten

I… think so? But maybe I am wrong. Like, I was imagining that an algebraic data type in FP is kind of an abstract datatype anyway, seeing as the underlying representation is usually abstract? Eg. A type + introductions + eliminators?

11:02 PM · Jun 14, 2021Twitter for iPhone

You’re unable to view this Tweet because this account owner limits who can view their Tweets. Learn more

Brendan Zabarauskas

@brendanzab

Jun 14, 2021

Yeah it’s weird! I was thinking that you’d need to somehow leave it up to the language implementation? Kind of a bit like using staging to avoid the circularity (with a bunch of handwaves).

Show replies