Interpreter for functional pure type systems.
☆21Jun 30, 2017Updated 8 years ago
Alternatives and similar repositories for pts
Users that are interested in pts are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Apr 18, 2018Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Lambda Calculus with quote and unquote☆19Jun 29, 2020Updated 5 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Feb 21, 2016Updated 10 years ago
- Proton VPN Special Offer - Get 70% off • AdSpecial partner offer. Trusted by over 100 million users worldwide. Tested, Approved and Recommended by Experts.
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆21Updated this week
- Sometimes when I feel sad I implement a dependently typed lambda calculus.☆15Mar 26, 2020Updated 6 years ago
- being an experiment with potato power☆23Jan 14, 2020Updated 6 years ago
- Design, play with, and analyze sequent calculus proof systems.☆15Sep 5, 2024Updated last year
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 6 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- being the materials from my YOW LambdaJam 2016 talk☆11Jun 11, 2016Updated 9 years ago
- Generation of abstract binding trees☆27Sep 26, 2025Updated 7 months ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆56Sep 11, 2025Updated 7 months ago
- an experiment in presenting code.☆14Aug 11, 2020Updated 5 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- formally and easily, describe the semantics.☆13Aug 17, 2020Updated 5 years ago
- A simple λProlog interpreter☆20Nov 29, 2021Updated 4 years ago
- Correctness of normalization-by-evaluation for STLC☆24Oct 1, 2019Updated 6 years ago
- An esoteric language based on overlapping tree-like structures☆10Oct 16, 2021Updated 4 years ago
- freshly-fermented, dependently-typed mustard, with a substructural aftertaste☆30Mar 31, 2020Updated 6 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- Experiments with effect systems☆12Apr 18, 2016Updated 10 years ago
- A simple supercompiler formally verified in Agda☆34Mar 17, 2017Updated 9 years ago
- ☆12Jul 8, 2019Updated 6 years ago
- Code for tutorials, papers and experiments. Mostly Agda, Coq and Haskell.☆21Feb 17, 2023Updated 3 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Inline, type safe X86-64 assembly programming in Agda☆70Jan 3, 2019Updated 7 years ago
- Proton VPN Special Offer - Get 70% off • AdSpecial partner offer. Trusted by over 100 million users worldwide. Tested, Approved and Recommended by Experts.
- Dealing with Flags and Options☆13Sep 10, 2021Updated 4 years ago
- A Model of Relationally Parametric System F in Coq☆23May 27, 2015Updated 10 years ago
- Implementation for ICFP 2020 paper☆54Jul 5, 2021Updated 4 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
- Pure relational SKI combinator calculus interpreter.☆11Jul 13, 2017Updated 8 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Feb 2, 2019Updated 7 years ago
- ☆12May 9, 2015Updated 10 years ago