discarded1023

6 ms·

1.
by discarded1023 1mo ago
Sounds great mate, come to Australia! [0] [0] https://theconversation.com/three-things-australia-must-do-t...
2.
by discarded1023 1mo ago
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 the agents in the system do
3.
by discarded1023 2mo ago
> 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 bijective correspondence, once again, a the
4.
by discarded1023 2mo ago
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 develop (or aim for) a notion of semantic completene
5.
by discarded1023 4mo ago
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 implications may be) ... ... but on the other hand I think you&#
6.
by discarded1023 4mo ago
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 represent explicitly a large number of intuitively obvious n
7.
by discarded1023 4mo ago
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 early 2000s has resolved this well enough. O
8.
by discarded1023 5mo ago
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 analysis of shape strikes me as what Euclid(&#x27
9.
by discarded1023 5mo ago
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 survey or two on modelling circuits with functions and
10.
by discarded1023 6mo ago
> 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 along these (Gentzen's) lines goes by the name &quo
11.
by discarded1023 6mo ago
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 uses ocaml (perhaps motivating some to learn that langu
12.
by discarded1023 6mo ago
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 thing was vague enough to include hydrogen) on boats, reducti
13.
by discarded1023 7mo ago
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 google for "lambda calculus string diagrams"
14.
by discarded1023 7mo ago
Here's another from a long time ago: https://dkeenan.com/Lambda/
15.
by discarded1023 7mo ago
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 of learning predicates (programs/relations)
16.
by discarded1023 8mo ago
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. Why? Because computation stops at values. This is traditi
17.
by discarded1023 8mo ago
Where do Hughes's Arrows fit in?
18.
by discarded1023 9mo ago
You'd like to know your fault tolerance is reliable and possibly even correct.
19.
by discarded1023 10mo ago
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...
20.
by discarded1023 1y ago
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] https://en.wikipedia
21.
by discarded1023 1y ago
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] but I'm not sure he has the right take on the
22.
by discarded1023 1y ago
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 optimisations (late 1980s). And of course there's the
23.
by discarded1023 1y ago
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 is expressive but AFAIK it has not (yet) prov
24.
by discarded1023 1y ago
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 full abstraction problem for PCF [1] ... was it
25.
by discarded1023 1y ago
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 about domains? e.g. what Andy Pitts made hay out of in the 19
26.
by discarded1023 1y ago
Yes, I was unaware of Smolka's early work and it does look very nice. (Much of Smolka's work seems underappreciated.) The evaluation in the paper under discussion of this work seems weak given that Smolka's early effort has a
27.
by discarded1023 1y ago
I can't speak to the point of doing this, but (IIRC/IIUC) you're talking paths and they're talking the entire computation tree, i.e., a term in their calculus represents all solutions, and computing normal forms makes th
28.
by discarded1023 1y ago
It's a nice write up but I'm not sure what the contribution is. I would have expected more engagement with Peter Van Roy's work, in particular his and Seif Haridi's epic book CTM [1] where the logic variable got properly
29.
by discarded1023 2y ago
@JoeDaDude -- on macOS using recent Chrome/FireFox the puzzles linked from the top-level page yield terminal JavaScript errors. It'd be great to see them in action. http://logicmazes.com/alice.html alice.html:
30.
by discarded1023 2y ago
Perhaps "Six Sources of Collapse" [1] may be what you're looking for. [1] https://en.wikipedia.org/wiki/Charles_Robert_Hadlock

More ›