dmwit / pi-eta-epsilon
An interpreter for the language described in "The Two Dualities of Computation: Negative and Fractional Types"
☆23Updated 12 years ago
Alternatives and similar repositories for pi-eta-epsilon:
Users that are interested in pi-eta-epsilon are comparing it to the libraries listed below
- System F implemented in Haskell☆24Updated 12 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- being the programs and code for a paper about general recursion☆24Updated 10 years ago
- Category theory and algebra☆28Updated 8 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Deep embedding of imperative programs with code generation☆23Updated 2 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 2 years ago
- Compositional type checking for Haskell☆36Updated 13 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Agda-style equational reasoning in Haskell☆52Updated 2 months ago
- Dependently typed elimination functions using singletons☆28Updated 2 months ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆32Updated 2 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 3 months ago
- Translation of Agda code in A. Löh and J. P. Magalhães *Generic Programming with Indexed Functors* to Idris.☆14Updated 7 years ago
- Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work☆19Updated 7 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆19Updated last month
- The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.☆2Updated 8 years ago
- ☆30Updated 6 years ago
- Type Theory with Indexed Equality☆25Updated 7 years ago
- Highly polymorphic algebraic structures with custom deriving strategies☆30Updated 3 years ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 3 years ago
- ☆19Updated 6 months ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago