benburrill / halt_is_defeat
Time-traveling C-like programming language for the Sphinx architecture
☆15Updated 10 months ago
Related projects ⓘ
Alternatives and complementary repositories for halt_is_defeat
- A constructive proof assistant for second order logic.☆33Updated last month
- A system to amalgamate any features you want into any language you need☆26Updated 2 years ago
- Fairly readable homoiconic language with primarily value (non-referential) semantics that balances the programmer's productivity with sca…☆62Updated 5 months ago
- SKI combinators☆50Updated 7 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆67Updated 7 years ago
- [Mirror] A close reading of the μKanren paper.☆41Updated 2 years ago
- Collapsing Towers of Interpreters☆86Updated 9 months ago
- Accompanying materials for "A Core Calculus for Documents"☆31Updated last year
- Programming with pure lambda calculus☆88Updated 2 weeks ago
- SPSC: A Small Positive Supercompiler☆32Updated 6 months ago
- ☆89Updated 3 years ago
- MIRROR of https://codeberg.org/catseye/Vinegar : A semi-concatenative language where every operation can fail☆12Updated last year
- The cuteness implementation of a dependently typed language.☆188Updated last year
- [Early Stages] Low level functional programming language with linear types, first class inline functions, levity polymorphism and regions…☆65Updated 9 months ago
- A general purpose statically-typed concatenative programming language.☆51Updated last year
- A sudoku game where you have to prove that your deductions are valid☆113Updated 2 years ago
- A set of files that can be used to create a working version of an early version of the CLU programming language☆37Updated 2 years ago
- WIP stack language that uses regex for control flow☆41Updated last year
- PROTOTYPE: A minimal scripting language - OOP via lambda functions and pattern matching☆53Updated 7 years ago
- Pocket sized programs☆54Updated last week
- Gallina to Bedrock2 compilation toolkit☆50Updated last month
- metamath proof enumerators and other things☆87Updated 3 months ago
- An automated theorem prover that uses Büchi automata.☆40Updated 3 years ago
- A custom parser/auto-formatter for Standard ML☆68Updated 11 months ago
- An experimental Racket implementation using LLVM/MLIR☆60Updated last year
- Proofs in Coq for the book Reflective Programs in Tree Calculus☆51Updated 3 years ago
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆27Updated 7 years ago
- A website for the #proglangdesign community on freenode☆109Updated 3 weeks ago
- TinyAPL, a tiny APL dialect and interpreter in Haskell☆38Updated 2 weeks ago