melt-umn / copperLinks
An integrated context-aware scanner and parser generator
☆20Updated last year
Alternatives and similar repositories for copper
Users that are interested in copper are comparing it to the libraries listed below
Sorting:
- An attribute grammar-based programming language for composable language extensions☆63Updated last week
- Attribute grammar Based Language Extensions for C☆40Updated 2 months ago
- Offline partial evaluation system for Prolog written using the cogen approach☆19Updated 8 years ago
- αProlog☆17Updated last year
- SML Parser Combinator Library☆28Updated 9 years ago
- A heuristic procedure for proving inequalities☆33Updated 6 years ago
- ☆14Updated 6 years ago
- The Mechanization of Standard ML☆73Updated 2 years ago
- An equational theorem prover based on Knuth-Bendix completion☆50Updated 2 months ago
- Higher Order Prolog with Extensional Semantics☆53Updated 4 years ago
- An implementation of Hoare and He's Unifying Theories of Programming in Isabelle☆35Updated last year
- Specware consists of a formal specification language and tools for transformation and refinement to efficient implementations in CommonLi…☆22Updated 3 years ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- LPTP: A Logic Program Theorem Prover, written by Robert F. Staerk in the mid 90's☆11Updated last year
- ☆58Updated 11 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- SIGPLAN website☆11Updated last week
- Interpreter for the reversible functional language rFun☆36Updated 7 years ago
- A mechanisation of Wasm in Isabelle.☆27Updated this week
- A (formalised) general definition of type theories☆57Updated 3 years ago
- An automated theorem prover for intuitionistic propostional logic☆12Updated 4 years ago
- Formalization of Regular Languages in Agda: regular expressions, finite-state automata, proof of equivalence, proof of the pumping lemma.☆18Updated 4 years ago
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆29Updated 7 years ago
- miniKanren with a first-order representation of the search space☆16Updated 10 months ago
- SPSC: A Small Positive Supercompiler☆35Updated last year
- Logic for story telling!☆34Updated 7 years ago
- Reason about Term Rewriting Systems☆16Updated 2 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 12 years ago
- Fast, simplified WAM-based Prolog system☆22Updated 3 weeks ago