mmaleki / LogicalDifferentiation
Differentiation in logical form by Stone duality.
☆8Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for LogicalDifferentiation
- secret project☆17Updated 6 years ago
- Educational implementation of dependent types☆19Updated 6 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- Idris, but it's C☆24Updated 6 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- The Alms Programming Language☆44Updated 6 years ago
- A Gradual Dependently-typed Language☆14Updated 5 years ago
- Optimizing Abstract Abstract Machines☆30Updated 7 years ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 8 years ago
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆34Updated 7 years ago
- A playground for type theory implementations in Racket☆20Updated 8 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 7 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- Invertible parsing for S-expressions☆33Updated last month
- An abstract machine using indexed containers and their zippers☆14Updated 7 years ago
- MLpolyR☆7Updated 8 years ago
- Backtracking monad in Haskell☆14Updated 2 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆19Updated 2 months ago
- a parallel, safe, iterative list operation language for systems programming☆16Updated 4 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆22Updated 4 years ago
- A naive θ..θ programming language☆27Updated 6 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 11 years ago
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 11 years ago
- LambdaConf 2017 Fusion Presentation☆10Updated 7 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 9 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- playing with resumable computations☆13Updated 5 years ago
- A Racket library for interacting with Idris over the IDE protocol☆30Updated 7 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆37Updated 11 years ago
- ☆29Updated 9 years ago