cognitive psychology. PhD 
The closest I've seen is probabilistic programming languages, where the values of random choices are automatically recorded for e.g. computing the total probability of a given execution.
Show this thread
Tracking the lineage of code across transformations is such a fundamental problem these days. Source-maps, debuggers, macros, ... We need a programming model where lineage (or provenance or whatever) is tracked *by construction*.https://twitter.com/pcwalton/status/1400589285917556737 …
-
-
-
For example, if I do: if f(x) { l.push(y); } Then later in the code, I should be able to ask dynamically: why is `y` in `l`? And the answer should include `f(x) == true at time T`.
Show this thread -
As an instance of this problem, I'm working on a program slicer. If I slice on z in x = 1; y = x; z = y - 2 Then x and y are both relevant. I should be able to answer "why is x relevant?", and the answer should be at least "because y is relevant and x is used for y".
Show this thread
End of conversation
New conversation -
-
-
You say that, but you're not going to like it :)
-
Also, dynamic data dependencies are not the same thing as state mapping a.k.a. the debug problem. (You can unify them by saying the program is just another piece of data, but I doubt that's wise here.) The OP was right to put debugging on the implementation, not the language.
- Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.