sligh
FStar
Our great sponsors
sligh | FStar | |
---|---|---|
8 | 42 | |
10 | 2,567 | |
- | 1.4% | |
7.9 | 9.9 | |
7 months ago | 3 days ago | |
OCaml | F* | |
MIT License | Apache License 2.0 |
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.
sligh
-
Do transpilers just use a lot of string manipulation and concatenation to output the target language?
But, you still seem hung up on this, so here’s actual code: https://github.com/amw-zero/sligh/blob/main/lib/codegen.ml.
-
Thoughts on the Rascal meta-programming language
Of course. Here was the first incarnation: https://github.com/amw-zero/sligh. It has a decent overview of the idea in the readme. To sum it up here, the idea is: have a language built around model-driven development and model-based testing, where you write a simple model of an application, and the implementation and model-based tests are compiled for you. I wrote about the overall model-based testing strategy here. This idea comes from self-certifying compilers that produce proofs of their correctness such as Cogent, but we drop the formality requirement and use property-based testing to compare the implementation and model.
-
What modern and mature language does both general purpose and data persistence ?
Honorable mention - I’m working on a language with similar goals: Sligh, and I’ve written about why I think it’s such a compelling idea before as well too.
-
April 2022 monthly "What are you working on?" thread
In Sligh, I spent most of the last month introducing a new intermediate representation to make tier splitting (choosing if code should live on the client or server) easier. My goal was to enable derived data, as in a model that queries other models for its data and combines them by processing them in memory. I've been using the example of a personal finance application, so imagine:
-
A list of new budding programming languages and their interesting features?
The language that I work on is Sligh, and it's out of the bulleted list because it's nowhere near as mature as any of those that I listed, and I'm more of a verification enthusiast vs. expert. Almost all of the ideas in it are borrowed from somewhere else, but I think the one quasi-unique idea is it allows you to write a pure logical description / specification of an application, and it generates full-stack web application code from that.
-
Has anyone tried Pest (parser) and Inkwell (LLVM library) with Rust? Are there any good projects on GitHub using this combo?
I’m currently using Pest, though I wouldn’t exactly recommend my compiler as a ‘good example’ just yet because I’m prototyping and just churning code out.
-
March 2022 monthly "What are you working on?" thread
Sligh
-
February 2022 monthly "What are you working on?" thread
So tactically it’s currently a source-to-source compiler, where in the source language (my language) you denote the system state transitions, i.e. by writing create!, update!, etc, and those get compiled to corresponding client and server code in the target language (JS for now, but hoping to support WebAssembly in the future). Heres an example program. The compiler source is there too. I’m hacking it together right now, so it’s not my finest work :D
FStar
- Lean4 helped Terence Tao discover a small bug in his recent paper
-
The Deep Link Equating Math Proofs and Computer Programs
I don't think something that specific exists. There are a very large number of formal methods tools, each with different specialties / domains.
For verification with proof assistants, [Software Foundations](https://softwarefoundations.cis.upenn.edu/) and [Concrete Semantics](http://concrete-semantics.org/) are both solid.
For verification via model checking, you can check out [Learn TLA+](https://learntla.com/), and the more theoretical [Specifying Systems](https://lamport.azurewebsites.net/tla/book-02-08-08.pdf).
For more theory, check out [Formal Reasoning About Programs](http://adam.chlipala.net/frap/).
And for general projects look at [F*](https://www.fstar-lang.org/) and [Dafny](https://dafny.org/).
-
If You've Got Enough Money, It's All 'Lawful'
Don't get me wrong, there are times when Microsoft got it right the first time that was technically far superior to their competitors. Windows IOCP was theoretically capable of doing C10K as far back in 1994-95 when there wasn't any hardware support yet and UNIX world was bickering over how to do asynchronous I/O. Years later POSIX came up with select which was a shoddy little shit in comparison. Linux caved in finally only as recently as 2019 and implemented io_uring. Microsoft research has contributed some very interesting things to computer science like Z3 SAT solver and in collaboration with INRIA made languages like F* and Low* for formal specification and verification. But all this dwarfs in comparison to all the harm they did.
-
What are the current hot topics in type theory and static analysis?
Most of the proof assistants out there: Lean, Coq, Dafny, Isabelle, F*, Idris 2, and Agda. And the main concepts are dependent types, Homotopy Type Theory AKA HoTT, and Category Theory. Warning: HoTT and Category Theory are really dense, you're going to really need to research them.
-
Why is there no simple C-like functional programming language?
F* is a dependently typed language that can be transpiled to idiomatic C via the KReMLin compiler. It’s very ML-ish to write and you can leave out some proofs. It also has the benefit of being used to write a formally verified TLS implementation that’s in wide use throughout industry.
-
[Media] Genetic algorithm simulation - Smart rockets (code link in comments)
As I said, dependent types attempt to solve this problem. F* is a language where you can express complex logic as a type. The catch is, these types are checked by an SMT solver. If the solver can satisfy the type checking, then great, and you move on. If it can’t, you have no idea why, and either have to guess or manually write the proof anyway. Contrast this with Standard ML which has a proof of the soundness of its type system.
-
Prop v0.42 released! Don't panic! The answer is... support for dependent types :)
So kind of like F*? https://www.fstar-lang.org/
-
old languages compilers
F*
-
Pegasus spyware was used to hack reporters’ phones. I’m suing its creators; When you’re infected by Pegasus, spies effectively hold a clone of your phone – we’re fighting back.
Nevermind that academia has come up with far safer ways to do a few things but social norms & inertia prevent their wider adoption (well okay, it also has a barrier to entry in the education required to use it but I don't think someone with the knowledge to meaningfully contribute to an OS kernel can be considered uneducated nor unable to learn).
-
[Hobby] Amateur Generalist Programmer Seeking to Put Bugfixing Skills to Good Use
Maybe that's a little off topic here, but if you like fixing bugs, i suspect you might also enjoy showing that there are no bugs at all. Check out languages like F* https://www.fstar-lang.org/ It's a proof-oriented programming language. You can use it to write code that has no bugs at all. And you once you're done, can convert F* to C or other languages.
What are some alternatives?
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.
Forscape - Scientific computing language
lean - Lean Theorem Prover
urweb - The Ur/Web programming language
dafny - Dafny is a verification-aware programming language
tailspin-v0 - A programming language with extreme data-pattern matching and data-declarative syntax, hopefully different enough to be interesting
koka - Koka language compiler and interpreter
Argon - Argon programming language
VisualFSharp - The F# compiler, F# core library, F# language service, and F# tooling integration for Visual Studio
edsl - Example of embedding TypeScript as an EDSL inside of another language
stepmania - Advanced rhythm game for Windows, Linux and OS X. Designed for both home and arcade use.