array
PDP_11_Simulator
array | PDP_11_Simulator | |
---|---|---|
6 | 1 | |
45 | 1 | |
- | - | |
0.8 | 10.0 | |
about 1 year ago | over 5 years ago | |
Kotlin | APL | |
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.
array
-
Ngn/k (free K implementation)
In some of the example programs written in KAP (my APL derivative), I tried to write it in a style that makes people unfamiliar with the array style more comfortable.
This code could of course have been written in a style similar to some of the more extreme examples, and they would have been significantly shorter in that case.
https://github.com/lokedhs/array/blob/master/demo/advent-of-...
-
Why would a Java prime sieve run at only half its speed _some_ of the times?
This issue isn't directly related to BitSet. I have observed the same thing in my programming language interpreter that runs on the JVM (well, it's written in Kotlin multiplatform so it runs on JS and Natively as well).
I start the interpreter and measue the time it takes to all all then numbers below 1000000000.
The first time I run it after starting the interpreter it always takes 1.4 seconds (within 0.1 second precision). The second time I measure the time it takes 1.7, and for every invocation following that it takes 2 seconds.
If I stop the interpreter and try again, I get exactly the same result.
I have not been able to explain this behaviour. This is on OpenJDK 11 by the way.
If anyone wants to test this, just run the interpreter from here: https://github.com/lokedhs/array
To run the benchmark, type the following command in the UI:
time:measureTime { +/⍳1000000000 }
- Is APL Dead?
- Symbolic Programming
-
Try APL
I'm the opportunity to mention my project that implements a language that is inspired by, and is mostly compatible with APL. It has some major differences, such as being lazy evaluated and providing support for first-class functions.
It also supports defining syntax extensions which is used by the standard library to provide imperative syntax, which means you can mix traditional APL together with your familiar if/else statements, etc.
At this point there isn't much documentation, and the implementation isn't complete, so I'm not actually suggesting that people run out to try it unless they are really interested in APL. I just took this opportunity since APL is mentioned so rarely here.
https://github.com/lokedhs/array
There is an example of a graphical mandelbrot implementation in the demo directory, that may be interesting.
-
Why am I wasting time on EndBASIC?
This post mirrors my feeling on this topic as well. Just like the author, I'm also working on a programming language which will not be used by a lot of people.
In fact, having a lot of users would make things complicated as I would have to stop making incompatible changes if I want to try something new.
Designing your own programming language is such a nice hobby, and something I believe a lot of programmers do. In fact, I would like to see links to other people's programming languages, just to see what people are playing around with at the moment.
Here is my project: https://github.com/lokedhs/array
PDP_11_Simulator
-
Ngn/k (free K implementation)
I can offer you the contrary opinion: why I would not use these kind of languages.
A couple of years ago I worked on a non-trivial APL application with one of my university professors and another student. We were trying to build a CPU simulator flexible enough to handle stuff ranging from PDP-11 up to Intel x86. The goal was to run some analysis on memory accesses performed by the x86 architecture. Quite an interesting project in which I worked on for around two year.
The code is still available if you're interested: https://github.com/emlautarom1/PDP_11_Simulator
The first implementation was done in APL using a book which I don't remember as reference. We had a couple of meetings where we learned APL and the general idea behind the design. Pretty soon we started to deal with a lot of issues like:
- We only found two implementations for the APL interpreter: GNU and Dyalog. GNU is free but pretty much abandoned. Support for Windows was (is?) nonexistent. Dyalogs version is proprietary so we couldn't use that (even when a "student" version was available).
What are some alternatives?
BQN - An APL-like programming language. Self-hosted!
kona - Open-source implementation of the K programming language
ride - Remote IDE for Dyalog APL
Kbd - Alternative unified APL keyboard layouts (AltGr, Backtick, Compositions)
ngn-apl - An APL interpreter written in JavaScript. Runs in a browser or NodeJS.
april - The APL programming language (a subset thereof) compiling to Common Lisp.
j-prez
bqn-libs - Informal collection of BQN utilities
jelm - Extreme Learning Machine in J
kdb - kdb+ Working Group from FINOS Data Technologies program
json - A tiny JSON parser and emitter for Perl 6 on Rakudo
pdp11.jl - PDP-11 Simulator written in Julia