mspertus / TAPL
Modify implementations for Pierce' Types and Programming Languages to add a REPL, convert into dune projects, and provide preconfigured development containers based on devfiles
☆45Updated last year
Alternatives and similar repositories for TAPL:
Users that are interested in TAPL are comparing it to the libraries listed below
- A deterministic parser with fused lexing☆72Updated last year
- A Verified Compiler for Gallina, Written in Gallina☆140Updated last month
- Demo for dependent types + runtime code generation☆67Updated last month
- Functional Programming in Lean☆77Updated 10 months ago
- Selected Papers of Dana S. Scott☆158Updated 9 months ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆113Updated last week
- ☆30Updated 5 months ago
- ☆46Updated last month
- Coq plugin embedding elpi☆160Updated this week
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated last month
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆64Updated 11 months ago
- Hoare Type Theory☆73Updated 2 months ago
- Programming Language Foundations in Lean☆26Updated 2 months ago
- A work-in-progress core language for Agda, in Agda☆46Updated last week
- Lecture notes on realizability☆73Updated last month
- high-performance cubical evaluation☆70Updated 4 months ago
- A collection of programming languages and type systems.☆33Updated 7 months ago
- Graph Theory [maintainers=@chdoc,@damien-pous]☆36Updated last month
- High level commands to declare a hierarchy based on packed classes☆97Updated last month
- EGraphs in OCaml☆65Updated last year
- A monadic library for symbolic evaluation☆59Updated last month
- A verified compiler for a lazy functional language☆34Updated last month
- Staged compilation with dependent types☆169Updated 2 weeks ago
- Datatypes as quotients of polynomial functors☆35Updated 4 years ago
- An automatic theorem prover in OCaml for typed higher-order logic with equality and datatypes, based on superposition+rewriting; and Logt…☆139Updated 5 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆56Updated 11 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆47Updated 5 months ago