mbudde / jana
An interpreter for Janus, the reversible programming language.
☆14Updated 4 years ago
Alternatives and similar repositories for jana:
Users that are interested in jana are comparing it to the libraries listed below
- Haskell port of the Tensor Algebra COmpiler☆16Updated 5 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆22Updated this week
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Updated 11 years ago
- An extended typed Lambda Calculus☆20Updated 3 months 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
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆18Updated 4 years ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 6 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 5 years ago
- A formalization of synthetic algebraic geometry in Agda☆13Updated 5 years ago
- Encoding of GHC Core inside MLIR☆18Updated 4 years ago
- ☆29Updated 9 years ago
- Used libraries: llvm-general, llvm-general-pure - 3.4.2-1; llvm version: 3.4.2-1; Based on http://www.stephendiehl.com/llvm/ solution.☆7Updated 9 years ago
- pesca: Proof Editor for Sequent Calculus (mirror)☆10Updated 7 years ago
- Animations for Elementary-Affine-Net interactions☆11Updated 5 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 5 years ago
- Deep-embedded combinators for strategic rewriting.☆15Updated 3 years ago
- Monadic Constraint Programming framework☆28Updated 6 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 10 years ago
- A synthesis-enabled solver for relational logic☆27Updated 6 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- An implementation of Fibonacci Anyons in Haskell☆22Updated 5 years ago
- Dependently Typed Metaprogramming Exercises☆22Updated 6 years ago
- IPython-style interaction for Cryptol☆15Updated 7 years ago
- A set of tools for building graph rewriting systems and more specifically, working with the chemlambda rewrite model of computation.☆11Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆21Updated 4 years ago
- library with a semiring class and some useful semirings☆11Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year