lkuper / lvar-semanticsLinks
PLT Redex models of LVar calculi
☆10Updated 10 years ago
Alternatives and similar repositories for lvar-semantics
Users that are interested in lvar-semantics are comparing it to the libraries listed below
Sorting:
- Supporting tool for Gradual Typing☆16Updated 5 years ago
- The LVish Haskell library☆80Updated 2 years ago
- The Spire Programming Language☆59Updated 10 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Hakyll support for Agda literate files☆19Updated 3 years ago
- ☆29Updated 9 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Link to preprints for POPL'18 and colocated events☆87Updated 6 years ago
- An implementation of structural subtyping of records and functions☆13Updated 6 years ago
- a logic-based trust-management system☆19Updated 12 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated last month
- Higher-order FRP compiler☆15Updated 3 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Luck -- A Language for Property-Based Generators☆34Updated 3 months ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- The language of the future!☆72Updated last year
- being an experiment with potato power☆23Updated 5 years ago
- Generation of abstract binding trees☆28Updated 7 months ago
- Formalism and proofs for esverify☆20Updated 7 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago