Alternatives
Products that do what Turing Property does
A homoiconic property system where everything is a Property.
- 1CS
TypeScript playground: https://www.typescriptlang.org/play?#code/KYDwDg9gTgLgBDAnmY...
2023 · github.com
- 2
- 3
- 4GA
Hi HN — I’ve been working on Gene, a general-purpose, homoiconic language with a Lisp-like surface syntax, but with a core data model that’s intentionally not just “lists all the way down”. What’s unique: the Gene data type Gene’s central idea is a single unified structure that always carries (1) a type, (2) key/value properties, and (3) positional children: (type ^prop1 value1 ^prop2 value2 child1 child2 ...) The key point is that the type, each property name, each property value, and each child can themselves be any Gene data. Everything composes uniformly. In practice this is…
Jan 2026 · github.com
- 5
- 6
- 7AR
Hey HN! I've been curious about the history of computer science and decided to try to read Turing's 1936 paper where he conceptualizes the Turing Machine, etc. I had trouble understanding the paper, read The Annotated Turing by Charles Petzold (which is wonderful), but felt that reading a reference implementation would help formalize my understanding. When I couldn't find an open source implementation, I decided to write my own. The implementation includes: - Abbreviated tables (m-functions) - Conversions to Standard Descriptions and Description Numbers - A working universal machine - A…
2023 · github.com
- 8RM
2016 · github.com
- 9AD
Greetings! A 2.5 weekends project to teach myself newer Python features (>= 3.10). Conditions are written as Lambda expressions that annotate parameters and return types, and coexist with type annotations. Symbols to share values between conditions are also supported to a limited extend.
2022 · github.com
- 10DT
2021 · github.com
- 11MA
2024 · willhbr.net
- 12MP
2022 · github.com
- 13SA
Hey HN, I’m a physicist turned quant. Some friends and I 'built' SymDerive because we wanted a symbolic math library that was "Agent-Native" by design, but still a practical tool for humans. It boils down to two main goals: 1. Agent Reliability: I’ve found that AI agents write much more reliable code when they stick to stateless, functional pipelines (Lisp-style). It keeps them from hallucinating state changes or getting lost in long procedural scripts. I wanted a library that enforces that "Input -> Transform -> Output" flow by default. 2. Easing the transition to Python: For many…
Feb 2026
- 14
- 15BD
2021 · app.blotato.com
- 16AP
2012 · github.com
- 17TA
2025 · gist.github.com
- 18HA
This absurd project started when I read a couple of blog posts that got very popular around here about solving the N queens puzzle using only Haskell's type system and TypeScript's type system. I figured I could implement Peano arithmetic using only TypeScript's type system. Turns out this have been done several times before, but I did it anyway. While working on it, I realized that you could emulate functions with conditional recursive types, writing them in a way that strongly resembles the equations that can be found in some functional programming languages. So I thought I could write a…
2023 · github.com
- 19DG
2021 · youtube.com
- 20
- 21LD
2019 · lexiconomy.org
- 22
- 23
Durable React architecture for AI coding agents
23d ago · store.moussasaidi.dev
- 24WW
Jan 2026 · reidsherman.com
Ranked by how close each launch is in meaning, then by votes. Refine with a description →