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 7 months ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- Cur dependently-typed language in miniKanren.☆17Updated 7 years ago
- The algebra for formal power series in elements of the Weyl algebra☆18Updated 7 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 10 months ago
- The Alms Programming Language☆44Updated 7 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 11 months ago
- An extended typed Lambda Calculus☆21Updated last year
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆15Updated 7 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Closure calculus implementation☆12Updated 6 years ago
- Source files used for the Cedille Cast videos☆12Updated 4 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
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- A categorical semantics library in Agda.☆17Updated 5 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- ☆23Updated 7 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Updated 7 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- a tiny tool for visualising substructual sharing in data structures 🕵️♀️☆17Updated 6 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- Parsers and (eventually) Idris code generator for WebIDL documents☆15Updated 7 months ago
- Examples from Introduction to Programming in ATS☆26Updated 11 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 4 years ago
- Generation of abstract binding trees☆27Updated this week