wcrichton

7 ms·

31.
by wcrichton 4y ago
"Sophisticated markup language with embedded JavaScript" is a fine model of Nota. You can also think about it as another syntax for a React program, like an alternative to JSX that's oriented at writing documents (prose-first
32.
by wcrichton 4y ago
My original paper on the system shows some more interesting examples, such as logical inference rules that can toggle between natural language and mathematical symbols: https://willcrichton.net/nota/ I'll be addin
33.
by wcrichton 5y ago
Yes, Flowistry only supports single-function analysis right now. Interprocedural analysis is my next goal. FWIW, part of the technical contribution of Flowistry is being able to analyze influence (or really effects / mutation) locally.
34.
by wcrichton 5y ago
Thanks for the reference! I hadn't heard of Atlas before and it seems super relevant.
35.
by wcrichton 5y ago
Ideally yes. But Flowistry relies on Rust's borrow checker, and Rust Analyzer does not yet support borrow checking.
36.
by wcrichton 5y ago
This is right -- the analysis here uses aspects of Rust which don't exist in other languages. Specifically, transitive mutability markers (&T vs. &mut T) and lifetime-based alias-analysis.
37.
by wcrichton 5y ago
I am the main author of the tool. Vytautas has helped me get the Rust compiler integration set up :-) The closer relation would be to Prusti [1] which is Vytautas' project on verifying Rust codebases. We use the same IR emitted by the
38.
by wcrichton 6y ago
I didn't know about #[repr(transparent)], I will add that to the blog post. Thank you!
39.
by wcrichton 6y ago
Hi, author of the code here. Why do I use mem::transmute? To highlight the fact that when using typestate, it's useful to understand operations that change the the value of an object as distinct from those that change the type of a
40.
Tyrade: A pure functional language for type-level programming in Rust(github.com)
3 points by wcrichton 6y ago|0 comments
41.
Tyrade: A pure functional language for type-level programming in Rust(github.com)
2 points by wcrichton 6y ago|0 comments
42.
Type-Level Programming in Rust(willcrichton.net)
3 points by wcrichton 6y ago|0 comments
43.
by wcrichton 6y ago
You should read the paper! http://penrose.ink/media/Penrose_SIGGRAPH2020.pdf They include: * Vector spaces * Function diagrams * Geometric illustrations * Polygonal meshes * Ray tracing diagrams The linked article is p
44.
JQuery, but for Types(willcrichton.net)
3 points by wcrichton 6y ago|0 comments
45.
Type-Level Programming in Rust(willcrichton.net)
3 points by wcrichton 6y ago|0 comments
46.
Types over Strings: Extensible Architectures in Rust(willcrichton.net)
5 points by wcrichton 7y ago|0 comments
47.
The Last Decade of Programming, According to Google Trends(willcrichton.net)
3 points by wcrichton 7y ago|0 comments
48.
by wcrichton 7y ago
Another great space of exercises in this vein are in-place operations on binary trees. Specifically, rebalancing [1] proved particularly tricky for my students. I think it's a good litmus test for whether you understand ownership, borr
49.
by wcrichton 7y ago
You may be interested in Penrose ( https://penrose.ink ) which generates graphics of math figures from equation. I don’t know if they have as much in the way of a constraint language, but it’s certainly in a similar vein of work,
50.
Probabilistic Programming with Variational Inference: Under the Hood(willcrichton.net)
4 points by wcrichton 7y ago|0 comments
51.
What Makes a Graphics Systems Paper Beautiful(graphics.stanford.edu)
147 points by wcrichton 7y ago|6 comments
52.
by wcrichton 8y ago
https://github.com/stanford-cs242/f18-assignments
53.
by wcrichton 8y ago
Yes, the content is on the course website: http://cs242.stanford.edu/f18/
54.
by wcrichton 8y ago
The only prerequisites are basic discrete math (first-order logic, sets, etc.) and computer systems (C, memory management, threading) knowledge.
55.
by wcrichton 8y ago
Thanks for the kind words!
56.
by wcrichton 8y ago
Hi, author of the paper here, happy to answer any questions.
57.
by wcrichton 8y ago
Having written a handful of probabilistic programs, I don’t think there’s no modularity at all. You can still abstract a complex stochastic process behind a function. I think it’s more that certain tasks are necessarily antimodular, eg doin
58.
by wcrichton 8y ago
I’m definitely not advocating for an automated way of building these models, for the reasons you point out. Instead, I’m saying more that probabilistic models are not taught in a way that we can easily map our knowledge structures onto them
59.
Compiling Knowledge into Probabilistic Models(willcrichton.net)
68 points by wcrichton 8y ago|9 comments
60.
by wcrichton 8y ago
I taught this concept in my course on Programming Languages at Stanford. If you’d like a more pedagogic introduction to both session types and their implementation, check out the course notes: http://cs242.stanford.edu/f18&#

More ›