urweb
tlaplus
Our great sponsors
| urweb | tlaplus | |
|---|---|---|
| 6 | 38 | |
| 797 | 2,201 | |
| 0.3% | 1.2% | |
| 4.7 | 9.1 | |
| about 2 months ago | 6 days ago | |
| Standard ML | Java | |
| GNU General Public License v3.0 or later | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
urweb
- My views on NeoHaskell
- Ask HN: Uncommon Web Languages?
-
What modern and mature language does both general purpose and data persistence ?
Examples of these are Links and Ur/web.
-
A list of new budding programming languages and their interesting features?
Ur-Web
-
Async/await inference in Firefly
I’ve heard of Links and Ur-web.
-
Lightweight Modular Staging and Embedded Compilers: Abstraction without Regret for High-Level High-Performance Programming
There is definitely prior art for this in Links and Ur-Web, but I'm not as tied to pure functional or dependently-typed languages. Though, we'll see where it goes. Coming up with the right "interface" for that has been a challenge, to say the least, so that's why I keep reading about what's out there.
tlaplus
- Ask HN: Usefulness of formal verification (Coq) and formal verification (TLA+)?
-
Quint: A specification language based on the temporal logic of actions (TLA)
```
https://github.com/tlaplus/tlaplus/blob/master/tlatools/org....
In any case, our whole team thinks TLA is great, and we're happy people like you and Ron find it so useful and insightful. We also think it is a very insightful.
-
Concurrent Data-structure Design Walk-Through
There are no tests! There are various ways to test concurrent data structures. You could use a stress test, where you spawn a lot of threads and let them mutate the map in a random way and then check the consistency of the map and some invariants. You could learn TLA+ and write a formal model of the map and then verify it.
-
In Which I Claim Rich Hickey Is Wrong
Dafny and Whiley are two examples with explicit verification support. Idris and other dependently typed languages should all be rich enough to express the required predicate but might not necessarily be able to accept a reasonable implementation as proof. Isabelle, Lean, Coq, and other theorem provers definitely can express the capability but aren't going to churn out much in the way of executable programs; they're more useful to guide an implementation in a more practical functional language but then the proof is separated from the implementation, and you could also use tools like TLA+.
https://dafny.org/
https://whiley.org/
https://www.idris-lang.org/
https://isabelle.in.tum.de/
https://leanprover.github.io/
https://coq.inria.fr/
http://lamport.azurewebsites.net/tla/tla.html
-
Programming Languages Going Above and Beyond
I wish something like Lamport's TLA+ (https://lamport.azurewebsites.net/tla/tla.html) was supported in modern language compilers - perhaps with annotations/macros and a mini formal DSL.
- Ask HN: How you understand TLA+ and how you use TLA+ in your projects?
-
A collection of lock-free data structures written in standard C++11
Checking the invariant with assert is also useful in my limited experience with concurrency.
https://lamport.azurewebsites.net/tla/tla.html
- Ask HN: Is writing a math proof like programming without ever running your code?
-
What I've Learned About Formal Methods in Half a Year
One advantage of formal methods is in determining "what was expected" (including all the goofy edge cases) without having to burrow into the details of code.
Take a look at Alloy (http://alloytools.org/) and TLA+ (https://lamport.azurewebsites.net/tla/tla.html) for example. (Or even the ancient Z ("Zed") notation (https://www.cs.cmu.edu/~15819/zedbook.pdf)).
-
How do I get the set of process identifier of PlusCal?
The pcal generator does *not* generate a definition for the set of labels. However, some users have suggested to add such a feature: https://github.com/tlaplus/tlaplus/issues/613
What are some alternatives?
Kind - A next-gen functional language [Moved to: https://github.com/Kindelia/Kind2]
dafny - Dafny is a verification-aware programming language
awesome-programming-languages - The list of an awesome programming languages that you might be interested in
coq - Coq is a formal proof management system. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs.
sligh - A language for certifying specification
apalache - APALACHE: symbolic model checker for TLA+ and Quint
FStar - A Proof-oriented Programming Language
stateright - A model checker for implementing distributed systems.
coffeescript - Unfancy JavaScript
gleam - ⭐️ A friendly language for building type-safe, scalable systems!
Corinna - Corinna - Bring Modern OO to the Core of Perl