LinearML
cogent
LinearML | cogent | |
---|---|---|
2 | 4 | |
425 | 157 | |
- | 0.0% | |
10.0 | 0.0 | |
almost 7 years ago | about 1 year ago | |
OCaml | Isabelle | |
GNU General Public License v3.0 or later | GNU General Public License v3.0 or later |
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.
LinearML
-
Why is there no simple C-like functional programming language?
LinearML
-
Are there any ML style languages with no runtime?
LinearML almost fits the bill, but it doesn't have manual memory management. It has a linear type system that is similar to Rust's borrow checker. All values are required to be used exactly once, except for primitives types which can be used multiple times. You can observe a value (similar to Rust's shared reference), but you can't store observed values in records or variants.
cogent
-
Let's collect relatively new research programming languages in this thread
Cogent, late 2010s, a language with linear types for verification. The idea is that you write functional-looking code that is easy to verify using the functional semantics, but with an efficient compilation strategy enabled by linear types to get realistic system programs.
-
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.
-
Are there any ML style languages with no runtime?
That made me think of this project Cogent. This is almost certainly not what you’re looking for, because it’s aimed at formal verification. But, it does have some interesting properties, like manual memory management through uniqueness types. It doesn’t even support recursion though so, probably not so good as a general purpose PL.
-
I'm a freelancer and I've got a customer who is asking for USB driver for a new device. They want it written in c++ and I said I'd only consider creating and supporting it if it was written in Rust. 🤷♂️
https://github.com/NICTA/cogent is for auto generating isabelle theorems + C code.
What are some alternatives?
aith - [Early Stages] Low level functional programming language with linear types, first class inline functions, levity polymorphism and regions.
py4j - Py4J enables Python programs to dynamically access arbitrary Java objects
edsl - Example of embedding TypeScript as an EDSL inside of another language
programming-language-subreddits-and-their-choice-of-words - How do the different communities talk?
karamel - KaRaMeL is a tool for extracting low-level F* programs to readable C code
datafun - Research on integrating datalog & lambda calculus via monotonicity types
jasmin - Language for high-assurance and high-speed cryptography
cubicaltt - Experimental implementation of Cubical Type Theory
HVM - A massively parallel, optimal functional runtime in Rust
awesome-programming-languages - The list of an awesome programming languages that you might be interested in
koika - A core language for rule-based hardware design 🦑
futhark - :boom::computer::boom: A data-parallel functional programming language