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 9 months ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Cur dependently-typed language in miniKanren.☆17Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- The Alms Programming Language☆44Updated 7 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated last year
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- A simple implementation of linear type theory☆38Updated 8 years ago
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆15Updated 7 years ago
- Closure calculus implementation☆12Updated 6 years ago
- The algebra for formal power series in elements of the Weyl algebra☆18Updated 7 years ago
- A partial implementation of Protocol Buffers in Idris☆32Updated 8 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- Parsers and (eventually) Idris code generator for WebIDL documents☆15Updated 9 months ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 5 years ago
- 🌋 Idris implementation of patricia tree☆23Updated 5 years ago
- A categorical semantics library in Agda.☆16Updated 5 years ago
- Invertible parsing for S-expressions☆34Updated 7 months ago
- An encoding of linear logic in Coq with minimal Sokoban and blocks world examples☆22Updated 3 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
- ☆23Updated 7 years ago
- ☆21Updated 8 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- Examples from Introduction to Programming in ATS☆26Updated 11 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- A usable type system for call by push-value☆33Updated 5 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year