dpiponi / SASLLinks
A simple and educational compiler for the SASL programming language
☆23Updated 7 years ago
Alternatives and similar repositories for SASL
Users that are interested in SASL are comparing it to the libraries listed below
Sorting:
- Reason about Term Rewriting Systems☆18Updated 3 years ago
- the reflective tower Blond by Olivier Danvy & Karoline Malmkjær☆16Updated 7 months ago
- My Own Linear Lisp☆42Updated 7 years ago
- Standard ML compiler based on typed intermediate languages.☆51Updated 11 years ago
- CLP(SMT) on top of miniKanren☆38Updated 3 years ago
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆34Updated this week
- a self-hosting lambda calculus compiler☆37Updated 9 months ago
- Nominal logic programming extensions to miniKanren, based on alphaProlog.☆26Updated 11 years ago
- minikanren mips assembler/disassembler☆33Updated 10 years ago
- miniKanren for search, SMT for solving☆13Updated 6 years ago
- Generic implementation of different CFA families based on monadic decomposition☆23Updated 12 years ago
- This repository is supposed to hold a released version of Xanadu☆24Updated 4 years ago
- Pawns functional/imperative programming language compiler etc☆11Updated 8 months ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago
- Racket implementation of Cook and Lämmel's partial evaluation tutorial.☆32Updated 13 years ago
- αProlog☆18Updated 2 years ago
- software archaeology of reflective towers of interpreters☆16Updated 7 months ago
- A core concatenative programming language with variables and first-rank polymorphic type inference☆31Updated 5 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- Hope programming language interpreter☆42Updated 7 months ago
- source code for the bondi programming language☆44Updated 6 years ago
- A minimal ML, type-inferred, compiled, and/or interpreted in less than 750 lines☆39Updated 5 years ago
- Abstract krivine machine implementing call-by-name semantics. In OCaml.☆45Updated 7 years ago
- Prolog implementation of microKanren☆44Updated 10 years ago
- Experimental implementation of a meta-hybrid JIT compiler mixing trace- and method-based compilation strategies.☆33Updated 8 months ago
- Scheme on SECD☆43Updated 4 years ago
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆31Updated 8 years ago
- x86-64 assembly as a Haskell EDSL☆36Updated 15 years ago
- An extended typed Lambda Calculus☆21Updated last year
- A Self-Interpreter for F-omega☆16Updated 10 years ago