guanxi

Relational programming in Haskell. Mostly developed on twitch.

3Distinct people

3Mentions

0Explicit recommenders

277GitHub stars

REPOSITORY AT A GLANCE

What to know before exploring

Relational programming in Haskell. Mostly developed on twitch.

GitHub

No documented product use has been verified yet.

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.

No other repository is repeatedly linked in the same discussions.

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

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

HN mentions by year3 dated mentions

Observed mentions: 2019-07-10 19:50:12 UTC to 2022-04-30 01:40:42 UTC.

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.
Period	Start (UTC)	End (exclusive, UTC)	Mentions	Comments
2019	2019-01-01 00:00:00 UTC	2020-01-01 00:00:00 UTC	2	2
2020	2020-01-01 00:00:00 UTC	2021-01-01 00:00:00 UTC	0	0
2021	2021-01-01 00:00:00 UTC	2022-01-01 00:00:00 UTC	0	0
2022	2022-01-01 00:00:00 UTC	2023-01-01 00:00:00 UTC	1	1

3 sources

Not an example of prolog but I wish Ed had time to continue developing https://github.com/ekmett/guanxi.

I hypothesize what was really missing to make the transputer successful was a language/compile-target to express propagators: https://youtu.be/nY1BCv3xn24 We are starting to see languages that could leverage such an architecture: * http://minikanren.org/ * https://cuelang.org/ * https://github.com/ekmett/guanxi Is there an algebraic logic strongly associated with what we conventionally think of as types (see https://cuelang.org/docs/concepts/logic/) which we can effectively and efficiently compute unions and Boolean satisfiability?

This is also intimately connected with Ed Kmett's Guanxi project https://www.youtube.com/watch?v=D7rlJWc3474 https://github.com/ekmett/guanxi My understanding is he is using ideas from propagators and other places to make a performant logic programming framework in Haskell.