slite
pie
slite | pie | |
---|---|---|
5 | 10 | |
50 | 671 | |
- | 0.4% | |
5.5 | 10.0 | |
9 months ago | almost 3 years ago | |
Common Lisp | Racket | |
Apache License 2.0 | 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.
slite
-
Is Lisp particularly suitable for sole developer or small teams?
But that's also what makes it worse for large teams: the same "immediate" productivity doesn't always translate to clean long-time maintainable code. Working in a large teams involves creating the right incentives to developers for long term maintability. For instance, if developers have a hard time testing complex code, they're more likely to write unit tests to test components. In Lisp, testing complex code is super easy interactively, so unit-testing can sometimes be harder. (Actually, this was an inspiration for one of my open source tools: https://github.com/tdrhq/slite, I wanted to make testing as easy as interactive development)
-
CLEDE - the Common Lisp Emacs Development Environment
For the FiveAM integration, there is also https://github.com/tdrhq/slite/
-
LispWorks IDE vs Slime/Sly?
For instance, here's a custom tool I wrote that I can't live without today: https://github.com/tdrhq/slite/ (although I think somebody has since written a similar tool for LispWorks)
-
Interactively Fixing Failing Tests in Common Lisp
Also take a look at https://github.com/tdrhq/slite for a more natural TDD flow when running tests.
- Slite: Run your FiveAM tests interactively from Emacs
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?
parachute - An extensible and cross-compatible testing framework.
hackett - WIP implementation of a Haskell-like Lisp in Racket
Summer2022 - Lang Party 2022
anarki - Community-managed fork of the Arc dialect of Lisp; for commit privileges submit a pull request.
minipascal - MiniPascal implemented in Racket
ATS-Postiats - ATS2: Unleashing the Potentials of Types and Templates
SPLV20 - SPLV20 course notes
structured-haskell-mode - Structured editing minor mode for Haskell in Emacs
Idris - Codes related to Idris
Folly - An open-source C++ library developed and used at Facebook.
stalin - stalin brutally optimizing Scheme compiler, with Debianization patches
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.