benburrill / halt_is_defeatLinks
Time-traveling C-like programming language for the Sphinx architecture
☆16Updated 2 months ago
Alternatives and similar repositories for halt_is_defeat
Users that are interested in halt_is_defeat are comparing it to the libraries listed below
Sorting:
- Fairly readable homoiconic language with primarily value (non-referential) semantics that balances the programmer's productivity with sca…☆64Updated last year
- SKI combinators☆55Updated 8 years ago
- Collapsing Towers of Interpreters☆91Updated this week
- Bologna Optimal Higher-Order Machine, Version 1.1☆72Updated 8 years ago
- A system to amalgamate any features you want into any language you need☆26Updated 2 years ago
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆29Updated 7 years ago
- The cuteness implementation of a dependently typed language.☆190Updated 2 years ago
- ☆90Updated 3 years ago
- Automatically exported from code.google.com/p/intuitionistic☆31Updated 10 years ago
- A compiler for functional programs on serialized data☆164Updated 2 weeks ago
- PROTOTYPE: A minimal scripting language - OOP via lambda functions and pattern matching☆53Updated 7 years ago
- Apple array system☆66Updated last week
- A domain-specific language (DSL) for parsing regular, context-free and recursively enumerable languages.☆17Updated 2 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆53Updated 4 months ago
- [Mirror] A close reading of the μKanren paper.☆43Updated 3 years ago
- This is an implementation of interaction nets, with a familiar JavaScript-like syntax :)☆55Updated last week
- SPSC: A Small Positive Supercompiler☆35Updated last year
- WIP stack language that uses regex for control flow☆42Updated last year
- ☆26Updated last year
- Minimal, fast, robust implementation of the Calculus of Constructions on JavaScript.☆113Updated 8 years ago
- Dependently-typed language with Iverson-style implicit lifting☆122Updated 5 years ago
- A tiny lazy objective functional language☆17Updated 9 months ago
- Pocket sized programs☆57Updated 3 months ago
- This repository contains the Maude 2 interpreter source tree.☆43Updated 7 years ago
- A general purpose statically-typed concatenative programming language.☆54Updated 2 years ago
- An automated theorem prover that uses Büchi automata.☆42Updated 3 years ago
- The Brown Benchmark for Table Types (B2T2)☆64Updated last year
- A programming language somewhat resembling cellular processes.☆34Updated 3 years ago
- A proof checker meant for education. Primarily for teaching proofs of correctness of functional programs.☆114Updated 2 weeks ago
- Untyped Concatenative Calculus☆19Updated 3 years ago