Barry-Jay / Intensional-computationLinks
translations of a lambda abstraction to combinations of operators
☆18Updated 5 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 6 months ago
- Cur dependently-typed language in miniKanren.☆17Updated 7 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- Parsers and (eventually) Idris code generator for WebIDL documents☆15Updated 6 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months 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
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- Agda suffices: software written from A to Z in Agda☆16Updated 6 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
- The Alms Programming Language☆44Updated 6 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- being an experiment with potato power☆23Updated 5 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 11 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Source files used for the Cedille Cast videos☆12Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- ☆23Updated 7 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 9 months ago
- A partial implementation of Protocol Buffers in Idris☆31Updated 8 years ago
- A categorical semantics library in Agda.☆17Updated 5 years ago
- Experiments with linear types☆14Updated 7 years ago
- The algebra for formal power series in elements of the Weyl algebra☆18Updated 7 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- Examples from Introduction to Programming in ATS☆26Updated 10 years ago
- miniKanren with a first-order representation of the search space☆17Updated last year