Thanks for that feedback, I'll try to add some more well known examples. In the meantime, maybe the docs have more of the examples you're looking for? https://hale-lang.org/docs/tutorial/job-queue/
This seems like way too caustic of a reaction, OP is correct.
If you actually know what you're doing in $language, and you know how $language wants to emit the assembly or whatever, there's no huge advantage to just programming directly in assembly.
Absolutely - it's like, the "current agreed upon version", but indeed it's a point-in-time snapshot/simplification of whatever the thing being modeled actually is.
I think the reality is that it has to be baked into the language. Here's my real attempt at that - if you model the system in the language, the compiler can reason about the distributed fleet: https://hale-lang.org/proof/
Does that reading intonate that had the plaintiff chosen a more benign injection, only to prove that an LLM was involved, rather than to alter the outcome, the judge would have looked at the situation differently?
No, it doesn’t intimate that the judge would forgive benign or joke attempts at prompt injection to “expose” the use of AI, the article specifically mentions that the judge sanctioned them as a result of them continuing to add hidden text that only contained assinine comments after the initial attack. RTFA
I think you should read the source material in full. But there was no AI involved in the process, it was read on printed paper by a human being who saw the prompt and was like "lol I am not AI". The order talks about how many courts do use AI systems but even then the precedent on prompt injection is that its seen as dishonest and the automated systems (in a different case in a different country, talked about in this as a reference) also caught the prompt injection attempt. In all cases, it is not seen as okay to do.
Not really pursuing it at this point, but it seems so intuitive that organizational harnesses will converge on like, agent personas that are constructed just-in-time from shared knowledge graphs.
I've been working on a language that codifies a single abstract _situated_ unit of computation. It sits at the intersect of memory, process placement, callstack, lifetime, and domain graph. Because it's the only unit of structure in the language, everything is layered recursively, which means the compiler can reason about the codebase at layers that we'd normally leave to third party tooling, ci, or other infra:
reply