darius / mccarthy-to-bryantLinks
Propositional logic in terms of if-then-else
☆15Updated 8 years ago
Alternatives and similar repositories for mccarthy-to-bryant
Users that are interested in mccarthy-to-bryant are comparing it to the libraries listed below
Sorting:
- A small language to demo turning an interpreter into a compiler☆11Updated 8 years ago
- Category Theory in Agda☆13Updated 7 years ago
- The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.☆2Updated 8 years ago
- Datalog implementation in Haskell. Experimental proving ground for knowledge-base ideas.☆23Updated 6 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- Metacircular evaluator for a tiny fexpr language☆44Updated 13 years ago
- The Prettiest Printer☆35Updated last year
- Examples from Introduction to Programming in ATS☆26Updated 10 years ago
- ALGT 2.0☆30Updated 5 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- A set of tools for building graph rewriting systems and more specifically, working with the chemlambda rewrite model of computation.☆11Updated 8 years ago
- A static analysis tool for C.☆27Updated 5 years ago
- Higher Order Prolog with Extensional Semantics☆53Updated 4 years ago
- A compiler for a strongly typed, haskell-like functional language☆22Updated 7 years ago
- Logic for story telling!☆34Updated 7 years ago
- Coq proof for the paper "Compiling a Fifty Year Journey"☆13Updated 7 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- Dependently-typed language with Iverson-style implicit lifting☆125Updated 5 years ago
- lazy continued fractions☆19Updated 9 years ago
- Small programs with unknown halting status.☆12Updated 9 years ago
- a logic-based trust-management system☆19Updated 12 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- A small Haskell server for generating visual stories based on some ascertainable data about the requester.☆57Updated 13 years ago
- An idris backend compiling to chez scheme☆47Updated 7 years ago
- Compiler generator (3rd Futamura projection) for first-order Scheme☆13Updated 9 years ago
- The original Edinburgh LCF.☆33Updated 8 years ago
- Constraint Handling Rules☆16Updated 10 months ago
- Exact real arithmetic in Haskell☆25Updated 3 years ago
- ☆60Updated 6 years ago