Viewing profile — discarded1023
discarded1023
HN member- Joined
- Mon, Sep 21, 2020, 9:52 AM UTC
- HN karma
- 119
- Public activity
- 52 items
- HN profile
- View on Hacker News ↗
About discarded1023
No profile information was provided.
Recent public activity
-
comment
Comment #49228976
Sounds great mate, come to Australia! [0] [0] https://theconversation.com/three-things-australia-must-do-t...
-
comment
Comment #49228963
The game theorists/economists have studied this stuff in depth under the rubric of "mechanism design" or "market design". The relevant concept is "incentive compatibility" where th…
-
comment
Comment #49079770
> Similarly when people say "the rationals are countable" and "the computable numbers are countable" this is taking for granted the Cantor notion of measuring cardinality by biject…
-
comment
Comment #49063984
I've always wondered if there's more to FP than (more or less) point-free style with an associated algebra. TFA seems to stop just when it might get interesting. Did Backus ever de…
-
comment
Comment #48366040
Your comment blows my mind a bit. Of course we do! Here I am, having decided to blithely parade my ignorance here without any concern whatsoever for what is relevant (what the impl…
-
comment
Comment #48365977
Thanks for the reply and pointers. The intro to TFA> To most AI researchers, the frame problem is the challenge of representing the effects of action in logic without having to rep…
-
comment
Comment #48364530
This was a big concern when I was an undergrad in the 1990s. I've since wondered if bunched implications / separation logic / separation algebras / ... [1] that emerged in the earl…
-
comment
Comment #47800813
I had a look at George Stiny's "Shape: Talking about Seeing and Doing" book (MIT Press, 2006) which is freely available on the web [1]. The introduction is very waffly ... his anal…
-
comment
Comment #47799780
There's a tonne of work done in this space, e.g. Mary Sheeran's µFP from the early 1980s [1], at least for classical synchronous digital circuits. Some googling will dig up a surve…
-
comment
Comment #47612416
> We can't prove that the axioms of arithmetic are consistent [...] Sure we can! [1] ... but it requires (logically) stronger axioms. Assessing the relative strength of axioms alon…
-
comment
Comment #47462979
For those looking for a broader/more portable introduction, Xavier Leroy and Didier Rémy wrote a great high-level text on UNIX system programming a long time ago [1]. Of course it …
-
comment
Comment #47347525
There were plans to build a hydrogen plant near Whyalla in South Australia, a famous steel-making site; see e.g. [1]. The tl;dr uses were export (I expected ammonia but the whole t…
-
comment
Comment #47229464
Thanks for the link! Some very pretty stuff there. Missing AFAICT are categorical string diagrams. I'm only sort-of familiar with the notation for Haskell Arrows [1,2] but a quick …
-
comment
Comment #47226173
Here's another from a long time ago: https://dkeenan.com/Lambda/
-
comment
Comment #47146989
If we're going down that path: Ehud Shapiro got there back in 1984 [1]. His PhD thesis is excellent and shows what logic programming could do (/could have been). He viewed the task…
-
comment
Comment #46760245
At the risk of telling you what you already know and/or did not mean to say: not everything can be a value. If everything is a value then no computation (reduction) is possible. Wh…
-
comment
Comment #46506627
Where do Hughes's Arrows fit in?
-
comment
Comment #46407606
You'd like to know your fault tolerance is reliable and possibly even correct.
-
comment
Comment #45871640
A fantastic long read on this issue from a Glaswegian perspective (2022): https://www.lrb.co.uk/the-paper/v44/n18/ian-jack/chasing-ste...
-
comment
Comment #45358001
Luca Cardelli worked on this stuff a while back [1]. Perhaps "systems biology" [2] might provide an entry to the literature. [1] https://en.wikipedia.org/wiki/Luca_Cardelli [2] htt…
-
comment
Comment #44623190
Hi Simurgh! This seems like a very ambitious project. I wonder if you've had a look at what others have done in this space. I initially liked the look of Ehud Shapiro's stuff [1] b…
-
comment
Comment #44431755
The author is right to note that Haskell can optimise across module (abstraction) boundaries. However I remember that in my childhood that Debray [1] did a lot of work on link-time…
-
comment
Comment #44102287
Yes, AIUI Streicher's work was in the vein of your [4]. (I got a vague pointer to him a while back; I don't know who's responsible for the meat of the development.) Game semantics …
-
comment
Comment #44093723
Fantastic news and well deserved; even when Andy Pitts goes categorical his papers are very readable. I got told a while ago that Streicher's "sequential" domains had solved the fu…
-
comment
Comment #44085807
Thanks for the link. Is there anything new in these notes? They are cleanly presented but look like the greatest hits up to about 1982. Is there anything in there about reasoning a…