madgen / temporalogLinks
A Datalog extension to reason about time with CTL operators
☆14Updated 5 years ago
Alternatives and similar repositories for temporalog
Users that are interested in temporalog are comparing it to the libraries listed below
Sorting:
- Sometimes when I feel sad I implement a dependently typed lambda calculus.☆15Updated 5 years ago
- A general purpose programming language with linear types☆43Updated 8 years ago
- Stroll: an experimental build system☆41Updated 2 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- An experimental Haskell library for programming with effectful runners.☆30Updated 5 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Updated 7 years ago
- A compiler for a simple language using llvm☆35Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- So, you want to write a DSL interpreter...☆25Updated 6 years ago
- GHC-WPC is an extended GHC that exports the STG and other IR (.modpak) for the compiled modules and linker metadata (.ghc_stgapp) at appl…☆10Updated last year
- Closure calculus implementation☆12Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Toy version of Git/Mercurial built using recursion schemes. Implements lazy diffing and merging of merkle dir trees. Solves toy versions …☆3Updated 3 years ago
- ICFP tutorial☆39Updated 4 years ago
- Map lazy functional language constructs to LLVM IR☆50Updated 6 years ago
- Haskell port of the WebAssembly OCaml reference interpreter☆45Updated 2 years ago
- Some tools for provability logic☆37Updated 7 years ago
- Home of the fast-arithmetic library for number theory in ATS and Haskell.☆25Updated last year
- I/O utilities and datasets for algebraic-graphs☆14Updated 2 years ago
- being an experiment with potato power☆23Updated 5 years ago
- ☆36Updated last year
- Grammatical parsers - combinator library for parsing general context-free grammars☆37Updated 3 weeks ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago
- Efficient parser combinators for Haskell☆39Updated last week
- Edison: A Library of Efficient Data Structures☆56Updated 3 months ago
- static analysis of free monads☆24Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago