Barry-Jay / Intensional-computationLinks
translations of a lambda abstraction to combinations of operators
☆18Updated 6 years ago
Alternatives and similar repositories for Intensional-computation
Users that are interested in Intensional-computation are comparing it to the libraries listed below
Sorting:
- ☆16Updated 10 months ago
- Cur dependently-typed language in miniKanren.☆17Updated 7 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- The Alms Programming Language☆44Updated 7 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆15Updated 7 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- Parsers and (eventually) Idris code generator for WebIDL documents☆15Updated 10 months ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆36Updated last year
- Experiments with linear types☆14Updated 7 years ago
- being an experiment with potato power☆23Updated 5 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- A categorical semantics library in Agda.☆16Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Closure calculus implementation☆12Updated 6 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- ☆35Updated 6 years ago
- The algebra for formal power series in elements of the Weyl algebra☆18Updated 7 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- ☆23Updated 8 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- Invertible parsing for S-expressions☆34Updated 8 months ago
- A playground for type theory implementations in Racket☆20Updated 10 years ago
- Generation of abstract binding trees☆27Updated 2 months ago
- Home of the fast-arithmetic library for number theory in ATS and Haskell.☆25Updated last year
- Normalization-by-evaluation in miniKanren☆25Updated 2 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago