bordaigorl / stargazerView external linksLinks
A simulator for visualising the evolution of π-calculus terms
☆42Jun 14, 2022Updated 3 years ago
Alternatives and similar repositories for stargazer
Users that are interested in stargazer are comparing it to the libraries listed below
Sorting:
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- Timing attack resistant type systems☆24May 13, 2015Updated 10 years ago
- An Agda formalisation of the theory of directed containers☆12Apr 25, 2025Updated 9 months ago
- Typed DSLs for sorting☆20Feb 16, 2018Updated 7 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Sep 22, 2020Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Nov 27, 2015Updated 10 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Nov 24, 2021Updated 4 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- A language-generic implementation of equality saturation in Haskell☆22Dec 4, 2018Updated 7 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- An exploration and implementation of the lambda calculus.☆12Oct 18, 2016Updated 9 years ago
- A set of tools for building graph rewriting systems and more specifically, working with the chemlambda rewrite model of computation.☆12Dec 27, 2016Updated 9 years ago
- ☆12Feb 11, 2019Updated 7 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- ☆21Sep 8, 2021Updated 4 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- ☆21May 9, 2017Updated 8 years ago
- convert simple cryptol expressions into finite-state machines☆22Sep 15, 2017Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- Category Theory in Agda☆13Jan 16, 2018Updated 8 years ago
- GHCJS FFI bindings to the Electron API (WIP).☆10May 21, 2017Updated 8 years ago
- ☆12Jul 8, 2019Updated 6 years ago
- Fintie Sets in Cubical Agda☆12Aug 30, 2019Updated 6 years ago
- Relative Monad Library for Agda☆24May 29, 2019Updated 6 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆25Nov 29, 2025Updated 2 months ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Jan 3, 2019Updated 7 years ago
- Correctness of normalization-by-evaluation for STLC☆24Oct 1, 2019Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 3 months ago
- nominal sets in haskell☆19Nov 18, 2018Updated 7 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago