softlang / yasLinks
Yet Another Software Language Repository
☆19Updated 2 years ago
Alternatives and similar repositories for yas
Users that are interested in yas are comparing it to the libraries listed below
Sorting:
- Simple reference implementation of Hazelnut using js_of_ocaml and OCaml React. (frozen -- ongoing development in the hazel repo)☆29Updated 7 years ago
- A pure subset of Prolog, implemented in Haskell☆31Updated 11 years ago
- The Prettiest Printer☆34Updated last year
- ☆11Updated 7 years ago
- YUP is a proof checker that performs automatic checking of simple program-correctness proofs of functional programs through inductive and…☆36Updated 2 years ago
- System F in coq.☆19Updated 10 years ago
- Pure Type Systems for Functional Programming☆31Updated 4 years ago
- ☆82Updated last year
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- ☆21Updated 8 years ago
- Dealing with Flags and Options☆13Updated 3 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆28Updated last year
- ☆26Updated 8 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Higher-order FRP compiler☆15Updated 3 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- IO using sized types and copatterns☆35Updated 4 years ago
- A template set for writing semantics in LaTeX☆12Updated 9 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Coq proof for the paper "Compiling a Fifty Year Journey"☆13Updated 7 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago