ATS-Postiats
cicada
Our great sponsors
ATS-Postiats | cicada | |
---|---|---|
18 | 2 | |
349 | 967 | |
- | - | |
0.0 | 4.0 | |
about 1 year ago | 7 months ago | |
ATS | Rust | |
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.
ATS-Postiats
- Evolutie limbaje in industrie
-
The Little Typer – The Beauty of Dependent Type Systems, One Step at a Time
This is one of my two favorite books in The Little ...er series. The other is The Rational Schemer. These are two of the most advanced books in the series.
The Little Typer provides an introduction to dependent types. These can by used to guarantee things like "applying 'concat' to a list of length X and list of length Y returns a list of X+Y". It is also possible, to some extent, to use dependent types to replace proof tools like Coq. Two interesting languages using dependent types are:
- Idris. This is basically "strict Haskell plus dependent types": https://www.idris-lang.org/)
- ATS. This is a complex systems-level language with dependent types: http://www.ats-lang.org/
The Rational Schemer shows how to build a Prolog-like logic language as a Scheme library. This is a very good introduction to logic programming and the implementation of backtracking and unification is fascinating.
This is an excellent series overall, but these two books are especially good for people who are interested in unusual programming language designs. I don't expect dependent types or logic programming to become widely-used in the next couple generations of mainstream languages, but they're still fascinating.
-
The case against an alternative to C
> any safety checks put into the competing language will have a runtime cost, which often is unacceptable
This is completely wrong. The best counterexample is probably ATS http://www.ats-lang.org which is compatible with C, yet also features dependent types (allowing us to prove arbitrary statements about our programs, and check them at compile time) and linear type (allowing us to precisely track resource usage; similar to Rust)
A good example is http://ats-lang.sourceforge.net/DOCUMENT/ATS2CAIRO/HTML/c36.... which uses the Cairo graphics library, and ends with the following:
> It may seem that using cairo functions in ATS is nearly identical to using them in C (modulo syntatical difference). However, what happens at the level of typechecking in ATS is far more sophisticated than in C. In particular, linear types are assigned to cairo objects (such as contexts, surfaces, patterns, font faces, etc.) in ATS to allow them to be tracked statically, that is, at compile-time, preventing potential mismanagement of such objects. For instance, if the following line:
val () = cairo_surface_destroy (sf) // a type error if omitted
-
Security advisory: malicious crate rustdecimal | Rust Blog
For a low level language in which you actually need to prove that your code doesn't cause UB, see http://www.ats-lang.org/
-
Why is ATS not considered in the design of modern system languages?
Here's the homepage fo the language: http://www.ats-lang.org/. The trick to finding results about with google is to search "ATS programming language".
- Is it possible to make a functional programming language that is equivalent of Rust in terms of performance and resource efficiency?
-
Ask HN: What technology is “cutting edge” in 2022?
Another language I would add to this list is the ATS Language¹. First released in 2013, it tries to follow closer to performance and minimalism of C which can make it a good candidate for systems level programming.
-
Why Static Languages Suffer From Complexity
There is the ATS programming language. Though it is not very user-friendly :)
-
Are there any other programming languages that use a similar memory architecture?
ATS language and Pony are similar in that regard.
- Are there any ML style languages with no runtime?
cicada
-
What is a good alternative to Zsh?
As for POSIX compliance, this is from their FAQ:
Idk if this could be considered suckless, or if its what you're looking for, but heres one I recently saw in made in rust called cicada
What are some alternatives?
lean4 - Lean 4 programming language and theorem prover
chapel - a Productive Parallel Programming Language
oksh - Portable OpenBSD ksh, based on the Public Domain Korn Shell (pdksh).
ksh - ksh 93u+m: KornShell lives! | Latest release: https://github.com/ksh93/ksh/releases
c3c - Compiler for the C3 language
Agda - Agda is a dependently typed programming language / interactive theorem prover.
scriptisto - A language-agnostic "shebang interpreter" that enables you to write scripts in compiled languages.
virgil - A fast and lightweight native programming language
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.
daemonize-me - Rust library to ease the task of creating daemons
HVM - A massively parallel, optimal functional runtime in Rust
polyglot - Tool to count lines of source code.