netfarm | qvm | |
---|---|---|
8 | 7 | |
- | 408 | |
- | 0.7% | |
- | 4.0 | |
- | 20 days ago | |
Common Lisp | ||
- | 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.
netfarm
-
SBCL, QuickLisp and Jenkins
/u/read-eval-print-loop and I wrote GitLab CI testing configs, though I don't know how much relates to Jenkins. The general recipe is that one starts with an environment with SBCL (and Clozure and any other implementations you want to test on), clones in extra libraries if necessary, and then loads a short file which then loads the test suite, runs it, and exits with an appropriate status code, which the CI (presumably Jenkins too?) uses to produce a status to report.
-
[Question] Capitalism Made Me a Programmer; Need an Exit Strategy
Tests for the Netfarm suite and Minecraft mostly.
-
Can you guarantee that a function has no bugs?
I threw TLA+ at a few fine-grained locking algorithms I wrote. Here is one such model. The actual implementation is more complex than the model, in particular because the real implementation of this code handles multiple concurrent resource requests, but they are "independent" enough that I can probably just prove a model with just one resource; and, as Lamport said once, the model code doesn't have to be particuarly well optimized, whereas if you are breaking locks, you probably have substantially optimized already.
-
How do you use Lisp at work?
I work on a metacircular Common Lisp implementation, which makes for a very boring answer. In the next closest thing to a job, I use CL for just about the whole network stack, so really anything would be suitable. But I wouldn't dare throwing a new language into a workplace, and I am not sure how much they would appreciate it.
-
Does everyone here manually specify the entire project's dependency tree in .asd files?
One very niche "counter-example" is a system where loading files causes side effects, which must occur in some order. This happens in the Netfarm object system implementation, where most of the bootstrapping steps occur in an early system definition and a late system definition. In this case it is not enough to compute the dependency tree; it is necessary to pick a very specific ordering for things to not break.
-
How do you use utilities?
Alexandria, yes, anaphora, not anymore. I do have a fairly large utility package for decentralise2, but it mainly handles concurrency and debugging things.
-
We can build a fast Internet island of our own, while the rest of the Internet slows and dies.
If it's not distributed under the Cooperative Software License, I don't want it dirtying up my CPU.
- Dendrobatinæ considered harmful (v0.1.0)
qvm
-
I am planning my master's thesis to be about quantum computing and Lisp. Which books do you recommand on the subject ?
Quil's semantics are based off of an idea called the "quantum abstract machine". A piece of software which emulates the quantum abstract machine is called the Quantum Virtual Machine or QVM. It's open source and available here.
-
Lisp For Quantum Simulation?
More interestingly, the QVM repository includes a program called the dqvm which is the QVM but able to be run on an MPI cluster. This doesn't use any advanced state representation (such as matrix product states) and instead just very cleverly arranges for huge wavefunctions to be distributed across a cluster of arbitrary size and worked on in parallel.
-
The one-more-re-nightmare compiler – A fast regex compiler in Common Lisp
and/or in-line assembly code, and still can't optimize specific matrix shapes and structures, or do algebraic simplifications to eliminate work altogether.
The regex library FTA is a great, and clean, example of a long standing practice of compiling regexen, except it doesn't use any fancy VMs or any fancy JITs, just "when you see this regex, automatically turn it into this Common Lisp code, and let the Lisp compiler handle the rest."
[0a] https://github.com/quil-lang/qvm
[0b] COMPILE-OPERATOR: https://github.com/quil-lang/qvm/blob/master/src/compile-gat...
[1] https://www.gnu.org/software/libjit/
-
How do you use Lisp at work?
quantum computer simulator
-
Anybody using Common Lisp or clojure for data science
Yes, simulator, compiler, paper is some of it.
-
A compact quantum-computer that fits in 19-inch server racks
You can also do this with purely free and open source software like [0].
[0] https://github.com/quil-lang/qvm
-
Berkeley Lab Debuts Perlmutter, World’s Fastest AI Supercomputer
I wish I could try running the DQVM, the distributed quantum simulator written in Common Lisp [0], on this thing.
[0] https://github.com/quil-lang/qvm/tree/master/dqvm
What are some alternatives?
weblog - a weblog
screenshotbot-oss - A Screenshot Testing service to tie with your existing Android, iOS and Web screenshot tests
Second-Climacs - Version 2 of the Climacs text editor.
neanderthal - Fast Clojure Matrix Library
quilc - The optimizing Quil compiler.
typhoon - distributed system stress and load testing tool
doc - Flexible documentation generator for Common Lisp projects.
pyquil - A Python library for quantum programming using Quil.
mode-lambda - mode-lambda - sprite-based 2D graphics engine
CLPython - An implementation of Python in Common Lisp