HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
dhall-lang
dhall-haskell
Python2016–2022
dhall-lang / dhall-haskell

dhall-haskell

Maintainable configuration files

13Distinct people
13Mentions
0Explicit recommenders
974GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

Maintainable configuration files

GitHub

Where it is used

No documented product use was verified in the last source check.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 8:59:20 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by year13 dated mentions

Observed mentions: 2016-12-05 21:15:18 UTC to 2022-11-02 17:13:44 UTC.

012342016-01-01 00:00:00 UTC to 2017-01-01 00:00:00 UTC (exclusive): 2 mentions; 1 submissions, 1 comments20162017-01-01 00:00:00 UTC to 2018-01-01 00:00:00 UTC (exclusive): 3 mentions; 0 submissions, 3 comments2018-01-01 00:00:00 UTC to 2019-01-01 00:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 comments2019-01-01 00:00:00 UTC to 2020-01-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments20192020-01-01 00:00:00 UTC to 2021-01-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2021-01-01 00:00:00 UTC to 2022-01-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments2022-01-01 00:00:00 UTC to 2023-01-01 00:00:00 UTC (exclusive): 4 mentions; 0 submissions, 4 comments2022

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
20162016-01-01 00:00:00 UTC2017-01-01 00:00:00 UTC211
20172017-01-01 00:00:00 UTC2018-01-01 00:00:00 UTC303
20182018-01-01 00:00:00 UTC2019-01-01 00:00:00 UTC110
20192019-01-01 00:00:00 UTC2020-01-01 00:00:00 UTC101
20202020-01-01 00:00:00 UTC2021-01-01 00:00:00 UTC000
20212021-01-01 00:00:00 UTC2022-01-01 00:00:00 UTC202
20222022-01-01 00:00:00 UTC2023-01-01 00:00:00 UTC404

What Hacker News says

2 sources
> This is a property of System F, the core itself, which is quite well established. So when I repeatedly asked for the aspect of the language design that guaranteed this safety, and you responded with "the design guarantees it", you meant polymorphic lambda calculus, that, as it lacks infinite terms, preventing the creation of recursion through unfolding. Clearly stating the reliance of System F would go some way towards generating trust in the definition of the language. > There is no scientific debate to be had about this, anymore than there is a scientific "debate" about what temperature water boils at. A language is considered to be Turing complete if it can calculate any computable value that a Turing machine can. Brainfuck was proven to be Turing complete by Muller, and languages such as Piet have proven their own completeness by em
Read the rest
ulating or translating arbitrary Brainfuck programs. So, I'm afraid the question in regards to the CPP, is only is limited recursion acceptable for Turing completeness? The Turing-Church thesis specifically states that it should ignore resource limitations, which leads to the question of whether the limited recursion is a result of available resource or the language at hand. There are active debates on this topic, and it cannot be so readily dismissed. However, the point I raised with this, is the claimed safety of Dhall, in that it doesn't guarantee timely normalisation of its terms. Which I believe you may have also noticed. [0] > much like you're unlikely to write a Dhall configuration which takes 10 years to reduce when evaluated. True, however the guarantee of evaluation safety is false. There is no safety there when you can run out the available resource, such as time. And people do insane, unlikely things with a language, such as breaching the type safety of Scala, and in response, they developed DOT calculus, so that they might give those guarantees. Trusting a programmer not to do something stupid, is often the wrong thing to do. [1] There is a line which must be drawn, but you can't make guarantees that mislead the programmer to feel safe. [0] https://github.com/Gabriel439/Haskell-Dhall-Library/issues/6 [1] https://github.com/kanaka/mal/tree/master/awk
In Dhall 1.0.1: a total programming language specialized to configuration files

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.