pie
lean4
pie | lean4 | |
---|---|---|
10 | 55 | |
671 | 3,837 | |
0.4% | 5.0% | |
10.0 | 10.0 | |
almost 3 years ago | 1 day ago | |
Racket | Lean | |
GNU Affero General Public License v3.0 | 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.
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.
lean4
-
The Fermat's Last Theorem Project
Lean is free and open source and nothing to do with MS. Check out https://lean-lang.org/ and https://github.com/leanprover/lean4 -- no mention of MS or MSR (where de Moura was where he developed Lean 3 and started on Lean 4).
-
Dafny is a verification-aware programming language
Recently replaced by Lean, though.
https://github.com/cedar-policy/cedar-spec
https://lean-lang.org
- The Mechanics of Proof
- Natural Deduction in Logic (2015)
-
The Wizardry Frontier
Nice read! Rust has pushed, and will continue to push, the limits of practical, bare metal, memory safe languages. And it's interesting to think about what's next, maybe eventually there will be some form of practical theorem proving "for the masses". Lean 4 looks great and has potential, but it's still mostly a language for mathematicians. There has been some research on AI constructed proofs, which could be the best of both worlds because then the type checker can verify that the AI generated code/proof is indeed correct. Tools like Kani are also a step forward in program correctness.
-
Lean4 helped Terence Tao discover a small bug in his recent paper
Yeah, I believe they said intend for it to be used as a general purpose programming language. I used it to complete Advent of Code last year.
There are some really interesting features for general purpose programming in there. For example: you can code updates to arrays in a functional style (change a value, get a new array back), but if the refcount is 1, it updates in place. This works for inductive types and structures, too. So I was able to efficiently use C-style arrays (O(1) update/lookup) while writing functional code. (paper: https://arxiv.org/abs/1908.05647 )
Another interesting feature is that the "do" blocks include mutable variables and for loops (with continue / break / return), that gets compiled down to monad operations. (paper: https://dl.acm.org/doi/10.1145/3547640 )
And I'm impressed that you can add to the syntax of the language, in the same way that the language is implemented, and then use that syntax in the next line of code. (paper: https://lmcs.episciences.org/9362/pdf ). There is an example in the source repository that adds and then uses a JSX-like syntax. (https://github.com/leanprover/lean4/blob/master/tests/playgr... )
- A Linguagem Lua completa 30 anos!
- Lean 4.0
- Lean 4.0.0, first official lean4 release
-
Looking to start a new community for people who want to use code for everything
My latest inspiration to use code to a) replace my video editor, b) learn the basics of EDM production and c) understand a few topics in higher maths. This might sound very strange given there are specialised tools for these jobs. There's iMovie / Adobe Premier for video, there's GarageBand and FL studio for music and old good pen and pencil for math proofs. But these tools have three big limitations. First they have a lot of idiosyncratic learning, you have to spend quite some time getting used to these tools and my experience is that this time is quite upsetting. In contrast, you only have to learn to code one, maybe spend a few hours getting used to the syntax of another language. I'm not sure if that's true for most people but it was true for me using the tools mentioned above and wanted a place to discuss and see other people ideas and experiments. The second issue is that all these custom-made tools, are not composing easily. I can't search for all math proofs that used a single theorem. I can't create a plugin for iMovie and apply it to all my videos. I can't pick easily pick a rhythm from the internet and build upon for fun. There's also the issue of costs and version control, all tools I'm using today are open source and my work is stored in my repositories. This way I can create branches and test my ideas and I'm also confident that I can work in these projects in years.
What are some alternatives?
hackett - WIP implementation of a Haskell-like Lisp in Racket
z3_tutorial - Jupyter notebooks for tutorial on the Z3 SMT solver
Summer2022 - Lang Party 2022
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.
anarki - Community-managed fork of the Arc dialect of Lisp; for commit privileges submit a pull request.
Agda - Agda is a dependently typed programming language / interactive theorem prover.
minipascal - MiniPascal implemented in Racket
ATS-Postiats - ATS2: Unleashing the Potentials of Types and Templates
ts-sql - A SQL database implemented purely in TypeScript type annotations.
SPLV20 - SPLV20 course notes
roc - A fast, friendly, functional language.