Why Dhall advertises the absence of Turing-completeness — Haskell for all

total2Several people have asked why I make a big deal out of the Dhall configuration language being “total” (i.e. not Turing-complete) and this post will summarize the two main reasons:If Dhall is total, that implies that the language got several other things correct“Not Turing-complete” is a signaling mechanism that appeals to Dhall’s target audience“Because of the…

via Why Dhall advertises the absence of Turing-completeness — Haskell for all

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: