tvdstorm / oalgcompLinks
Object Algebra Composition
☆24Updated 12 years ago
Alternatives and similar repositories for oalgcomp
Users that are interested in oalgcomp are comparing it to the libraries listed below
Sorting:
- prototyping logic programming in Scala☆42Updated 3 years ago
- A toolkit for building multi-result supercompilers☆32Updated 4 years ago
- A Gradual Dependently-typed Language☆14Updated 6 years ago
- Arete is an experimental programming language.☆12Updated 2 years ago
- An implementation of the "lightweight" linear type system for System F◦ presented in "Lightweight Linear Types in System F◦" by Mazurak, …☆33Updated 10 years ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆36Updated 2 months ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A small profunctor library for idris☆17Updated 3 years ago
- I/O utilities and datasets for algebraic-graphs☆14Updated 3 years ago
- (CL)S - Combinatory Logic Synthesizer☆12Updated 4 years ago
- A Haskell parser for JVM bytecode files☆39Updated last year
- Generation of abstract binding trees☆27Updated 2 months ago
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated 2 weeks ago
- Implementations of various toy programming languages☆12Updated 7 years ago
- Two-Level Type Theory☆28Updated 6 years ago
- Luck -- A Language for Property-Based Generators☆35Updated 9 months ago
- A Coq-based synthesis of Scala programs which are correct-by-construction☆79Updated 3 years ago
- Formalization of the Dependent Object Types (DOT) calculus☆66Updated 3 years ago
- Experiments with linear types☆14Updated 7 years ago
- Free Monads and useful constructions to work with them☆26Updated 7 years ago
- every day i'm truffling☆70Updated 4 years ago
- generative programming & verification☆34Updated 5 months ago
- Talk: "Can Tensor Programming Be Liberated from the Fortran Data Paradigm?"☆66Updated 4 years ago
- Introduction to algebraic effects and handlers☆98Updated 7 years ago
- Lifting Reduction Semantics through Syntactic Sugar☆13Updated 7 years ago
- Notes and handouts from OPLSS 2019☆34Updated 6 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 11 years ago
- A partial implementation of Protocol Buffers in Idris☆32Updated 8 years ago
- A formalization of properties of a simple imperative, memory-safe language.☆20Updated 4 years ago
- Graded Dependent Type systems☆25Updated 2 years ago