AIT
lambda-8cc
AIT | lambda-8cc | |
---|---|---|
8 | 13 | |
124 | 598 | |
- | - | |
8.6 | 10.0 | |
25 days ago | over 1 year ago | |
Haskell | Common Lisp | |
- | 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.
AIT
-
Ray Tracer in a Boot Sector
It is described in https://github.com/tromp/AIT/blob/master/fast_growing_and_co...
-
Does quantum theory imply the entire Universe is preordained?
A = λxλyλz. x z (y (λ_.z)), which is encoded as bit 0 (left branch), while bit 1 (right branch) encodes prefix application.
[1] https://github.com/tromp/AIT/blob/master/ait/allA.lam
-
Show HN: Lambda-8cc – An x86 C compiler written in untyped lambda calculus
I expect so, as the author is familiar with my tools [1] for doing these optimizations.
[1] https://github.com/tromp/AIT
-
Minimalism in Programming Language Design
Haskell is not far from being a layer of syntactic sugar on top of the lambda calculus.
For an example of a non-trivial program, see this binary lambda calculus self-interpreter: https://github.com/tromp/AIT/blob/master/uni.lam
- Lambda Calculus in 400 Bytes
- Show HN: Lisp with GC in 436 Bytes
-
A Busy Beaver champion derived from scratch
While Goodstein sequences do get really long quite fast, they're not that easy to code. This [1] binary lambda calculus program may be the shortest possible, but still takes 351 bits. Meanwhile, in a mere 215 bits, we can encode a Laver table [2] program that potentially grows so much faster than Goodstein, that it's not even provable in ZFC [3].
[1] https://github.com/tromp/AIT/blob/master/goodstein.lam
[2] https://github.com/tromp/AIT/blob/master/laver.lam
[3] https://codegolf.stackexchange.com/questions/79620/laver-tab...
lambda-8cc
-
React Use C
ycombinator siding with the Amazonian cult of the carcinisation?! blasphemy! this submission is like a wanted poster for react-use-lambda to be summoned into existence from the great beyond https://github.com/woodrush/lambda-8cc
-
Any recommendations for advanced Lambda Calculus?
It is not what you want exactly, but there is a x86 C Compiler written in lambda-calculus, it has a pretty detailed "How it was done" in details.md - maybe you will find it interesting.
- This formula here is known as the “Standard Model Lagrangian”. It's an equation that encapsulates everything we currently know about particle physics.
- Show HN: Lambda-8cc – An x86 C compiler written in untyped lambda calculus
- GitHub - woodrush/lambda-8cc: x86 C compiler written in untyped lambda calculus
- Any projects want/need help?
-
lambda-8cc: An x86 C compiler written in untyped lambda calculus
That said, I'm not sure where is the actual compiler implementation, files in src/ seem to be various tools: https://github.com/woodrush/lambda-8cc/tree/main/src
What are some alternatives?
cosmopolitan - build-once run-anywhere c library
react-use-rust - Use Rust in your React!
lambda-calculus-devkit - A collection of lambda calculus interpreters and development tools
8cc - A Small C Compiler
elvm - EsoLangVM Compiler Infrastructure
williamcotton.com - williamcotton.com
OBNC - A Oberon-07 to C translator. Forked from http://miasap.se/obnc/
gameboy-brainfuck - Implementation of a brainfuck interpreter written for the Game Boy.
LjTools - LuaJIT 2.0 bytecode parser, viewer, assembler and test VM. Lua 5.1 parser, IDE and debugger.
cps - A formalization of continuation-passing style calculi in Coq [WIP]
nokolisp - Lisp interpreter and compiler from 1977-1988 for MSDOS.
vellum - Data Frames for Common Lisp