bkomuves / toy-language-server
Example language server (LSP) implementation for a toy language
☆59Updated 3 years ago
Alternatives and similar repositories for toy-language-server:
Users that are interested in toy-language-server are comparing it to the libraries listed below
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- ICFP tutorial☆39Updated 3 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 3 months ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 8 months ago
- Strongly-typed System F in Haskell☆116Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆56Updated 4 years ago
- Fast parsing from bytestrings☆157Updated 3 months ago
- Fast equality saturation in Haskell☆84Updated last month
- The Software Foundations book, in GHC☆82Updated 3 months ago
- Fine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck☆36Updated 3 years ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- An experimental Haskell library for programming with effectful runners.☆29Updated 5 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Named parameters (keyword arguments) for Haskell☆94Updated last month
- Chapelure is a diagnostic library for Haskell☆45Updated last year
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- Benchmarks for capture-avoiding substitution☆113Updated this week
- A collection of Notes on GHC☆69Updated 6 years ago
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆72Updated 2 weeks ago
- Interpreter for GHC Haskell☆22Updated 5 years ago
- ☆18Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- Reimplementation of Parsley in Haskell, with improvements☆52Updated last year
- ☆47Updated 4 months ago