CMU-HoTT / scottLinks
Selected Papers of Dana S. Scott
☆165Updated last year
Alternatives and similar repositories for scott
Users that are interested in scott are comparing it to the libraries listed below
Sorting:
- Coq plugin embedding elpi☆177Updated this week
- Benchmarks for capture-avoiding substitution☆120Updated 4 months ago
- Lecture notes on realizability☆74Updated 8 months ago
- EPIT 2020 - Spring School on Homotopy Type Theory☆107Updated 4 years ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆124Updated 3 years ago
- Logical manifestations of topological concepts, and other things, via the univalent point of view.☆261Updated this week
- LaTeX code for a paper on lean's type theory☆149Updated 3 years ago
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆67Updated last week
- A function definition package for Coq☆233Updated last week
- Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]☆115Updated 3 weeks ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- High level commands to declare a hierarchy based on packed classes☆102Updated last week
- A library of mechanised undecidability proofs in the Coq proof assistant.☆124Updated last month
- Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT☆129Updated 2 months ago
- Variations on Kirby & Paris' hydra battles and other entertaining math in Coq (collaborative, documented, includes exercises) [maintaine…☆80Updated 9 months ago
- An experimental proof assistant based on a type theory for synthetic ∞-categories.☆249Updated 2 months ago
- ☆92Updated 6 months ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
- 😎TT☆233Updated 2 months ago
- A proof assistant for higher-dimensional type theory☆216Updated last month
- Lecture notes on univalent foundations of mathematics with Agda☆230Updated last year
- Modeling and Proving in Computational Type Theory☆117Updated 2 months ago
- Implementation of the λΠ-calculus modulo rewriting☆217Updated 2 months ago
- high-performance cubical evaluation☆75Updated 5 months ago
- A work-in-progress core language for Agda, in Agda☆55Updated 2 weeks ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆63Updated last year
- A tutorial on how Agda infers things☆62Updated 3 months ago
- Total Parser Combinators in Agda☆132Updated 2 months ago
- A (formalised) general definition of type theories☆57Updated 4 years ago
- Compiling Agda code to readable Haskell☆194Updated 2 weeks ago