tlaplus
Elm
Our great sponsors
tlaplus | Elm | |
---|---|---|
37 | 198 | |
2,188 | 7,434 | |
1.4% | 0.7% | |
9.1 | 5.4 | |
7 days ago | 16 days ago | |
Java | Haskell | |
MIT License | BSD 3-clause "New" or "Revised" 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.
tlaplus
-
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+.
-
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.
-
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.
- 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)).
-
Can we make useful streaming APIs that disallow deadlocks?
I think that the traits in this library could be amenable to a proof of lock free behaviour at least for graphs composed entirely of Uniform flow nodes. but right now it's just a hunch. I a little while thinking about it over the last couple of weeks, but a proof, if forthcoming, will definitely be more complicated than I originally hoped. So to the second point of the post title/question does this really disallow deadlocks? I don't know. I think I'll definitely need some kind of proof assistant, and write now am thinking about TLA+, because of it's ability to reason about concurrent systems.
- Benefits to not unit testing every class?
-
How has studying Mathematics changed/shaped your worldview?
Leslie Lamport's TLA+ is also good, but that's used more for reasoning about distributed systems https://lamport.azurewebsites.net/tla/tla.html
Elm
-
Ludic: New framework for Python with seamless Htmx support
Elm [1] is based on a similar idea. Build your app from pure functions that return HTML tags.
-
Learning Elm by porting a medium-sized web front end from React (2019)
elm is a lovely lang. it would be nice to have modern APIs on it.
here's the project for new eyes:
-
Can you make your own JavaScript by implementing ECMAScript standard?
You also wouldn't really be creating your own new programing language. You would be creating something that can run JavaScript by following JavaScript standards and syntax. You might be able to add some non-standard features of your own on top of those standards, or include your own standard library of helpers or utilities, but you can't completely make a new or alternative language and then load it in the browser (or at least not by reimplementing ECMAScript standards... you actually can make your own language that runs within any Javascript enviroment, if you provide an interpreter or compiler that transforms it into valid JS. Some people have done something like this, eg Elm: https://elm-lang.org/).
- Course using F#: Write your own tiny programming system(s)
-
Building React Components Using Unions in TypeScript
I get it. However, the whole point of using Unions to narrow your types, ensure only a set of possible scenarios can occur, and only access data of a particular union when it’s safe to do so. That’s some of what pattern matching can provide, and 100% of what using switch statements in TypeScript with their Discriminated Unions can provide. Yes, it’s not 100% exhaustive, but TypeScript is not soundly typed, and even Elm which is still has the same issue TypeScript does: You’re running in JavaScript where anything is possible. So it’s good enough to build with and much better than what you had.
-
How to render a basic calendar UI in Elm
The beauty of a language like Elm (and other lambda-calculus / functional programming inspired languages) is that there's very little transformation involved in going from an idea to code. And that seems to have a big impact on getting things done.
- Como desenvolvi um backend web em Clojure
-
Is it possible to write games like Pac-Man in a functional language?
I think the most fun and approachable way for beginners to build games with functional programming is with Elm [1].
See a few (small, demo) games built by the community in [2] .
Notice Elm has abandoned the FRP approach in favor of Model-View-Update [3].
- Qual a linguagem que vocês mais gostam de programar?
What are some alternatives?
rescript-compiler - The compiler for ReScript.
haskelm - Haskell to Elm translation using Template Haskell. Contains both a library and executable.
purescript - A strongly-typed language that compiles to JavaScript
yew - Rust / Wasm framework for creating reliable and efficient web applications
idris - A Dependently Typed Functional Programming Language
reflex - Interactive programs without callbacks or side-effects. Functional Reactive Programming (FRP) uses composable events and time-varying values to describe interactive systems as pure functions. Just like other pure functional code, functional reactive code is easier to get right on the first try, maintain, and reuse.
haskell-names - Haskell suite library for name resolution
language-thrift - Haskell parser for the Thrift IDL format.
Vue.js - This is the repo for Vue 2. For Vue 3, go to https://github.com/vuejs/core
Svelte - Cybernetically enhanced web apps
dafny - Dafny is a verification-aware programming language
Cycle.js - A functional and reactive JavaScript framework for predictable code