ATS-Postiats
pie
ATS-Postiats | pie | |
---|---|---|
18 | 10 | |
349 | 671 | |
- | 0.4% | |
0.0 | 10.0 | |
about 1 year ago | almost 3 years ago | |
ATS | Racket | |
GNU General Public License v3.0 or later | GNU Affero General Public License v3.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.
ATS-Postiats
- What is the most feature-rich programming language
- 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.
-
Does Rust have any design mistakes?
Not being ATS
-
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".
-
ESPOL, NEWP, Mesa, Cedar, Modula-2, Modula-2+, Modula-3, Oberon, Oberon-2, Component Pascal, Active Oberon, D, C#, F#, VB, Ada, Go, Swift, just a few examples.
In SPARK's case, you have to state your invariants in even greater precision than in Rust, and naturally it has worse inference. That's okay, the same happens in a certain language with Atrocious Type Syntax.
-
What are all the situations you can't do compile time type-checking when building a programming language?
Yes, things like mentioned in the post can be expressed and checked statically, as demonstrated by languages like Idris and ATS. ATS might be even more relevant as it's an imperative language too, it can get rather low-level (like talking about properties of C runtime functions) while proving required properties statically, and it includes a solver for certain amount of arithmetics so that you don't need to prove obvious mathematical identities to the compiler. http://www.ats-lang.org/
- Is it possible to make a functional programming language that is equivalent of Rust in terms of performance and resource efficiency?
pie
-
Can DSLs in Racket be its own language?
Pie, a dependently typed language for learning dependently typed programming
-
is CS an engineering practice?
The computer scientists who are figuring these things out are constructing the tools that software engineers need; just like the mathematicians who developed calculus and the physicists who extended Newtonian mechanics into something engineers can apply. Just as an engineer's tools and materials are calculus and physics (not hammers or concrete and steel), a software engineer's tools and materials are proof-assistants, category theory, linear polarized logic, and dependent type theory (not the Rust programming language or the UNIX platform).
-
Carp – a statically typed, non-GC Lisp language
That's basically this[0] book, is it not?
[0] https://thelittletyper.com
-
Is Lisp particularly suitable for sole developer or small teams?
I really should read https://thelittletyper.com/
- The Little Typer – The Beauty of Dependent Type Systems, One Step at a Time
-
RacketCon 2022
It lets you create languages like Pie which is designed to teach others about dependent types:
https://thelittletyper.com/
-
Honest question: why is Haskell not a lisp / built on s-expressions?
Yep, this is one possibility - an example is the language pie from the book The Little Typer. But my claim was not that there are no expressions for types, just that declarations aren't expressions.
What are some alternatives?
lean4 - Lean 4 programming language and theorem prover
hackett - WIP implementation of a Haskell-like Lisp in Racket
chapel - a Productive Parallel Programming Language
Summer2022 - Lang Party 2022
cicada - An old-school bash-like Unix shell written in Rust
anarki - Community-managed fork of the Arc dialect of Lisp; for commit privileges submit a pull request.
c3c - Compiler for the C3 language
minipascal - MiniPascal implemented in Racket
virgil - A fast and lightweight native programming language
SPLV20 - SPLV20 course notes
HVM - A massively parallel, optimal functional runtime in Rust
structured-haskell-mode - Structured editing minor mode for Haskell in Emacs