zachhalle / hotcLinks
Notes on higher-order typed compilation. Probably wrong
☆23Updated 3 years ago
Alternatives and similar repositories for hotc
Users that are interested in hotc are comparing it to the libraries listed below
Sorting:
- Formalizations of Gradually Typed Languages in Agda☆58Updated this week
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆74Updated 7 years ago
- Course Webpage for B522 Programming Language Foundations, Spring 2020, Indiana University☆55Updated 5 years ago
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆26Updated 3 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 3 years ago
- A formalization of the textbook Elements of Set Theory☆59Updated 4 years ago
- Coq formalizations and proofs of (data) structures and algorithms.☆47Updated 7 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated 3 weeks ago
- ☆15Updated last year
- The Penn Locally Nameless Metatheory Library☆76Updated 7 months ago
- Benchmarks for capture-avoiding substitution☆120Updated 5 months ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆85Updated 5 years ago
- Normalization by evaluation of simply typed combinators.☆26Updated 3 years ago
- Communication between Coq and SAT/SMT solvers☆160Updated last month
- A simple Depdently-Typed Language for Research and Learning☆57Updated 9 years ago
- Educational Proof Assistant for Type Theory☆80Updated last year
- A monadic library for symbolic evaluation☆71Updated 3 months ago
- Coq code and exercises from the Coq'Art book [maintainers=@ybertot,@Casteran]☆126Updated 8 months ago
- PL conference deadline countdowns☆63Updated 2 months ago
- A command-line tool to generate Latex (inference rules) from inductive coq definitions.☆30Updated 9 years ago
- mirror of A simple type-theoretic language: Mini-TT☆41Updated 8 years ago
- Types and Programming Languages☆37Updated 11 years ago
- A verified polyhedral scheduling validator in Coq.☆22Updated last year
- Denotational semantics based on graph and filter models☆23Updated 10 months ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated last year
- ☆23Updated 5 years ago
- Abstracting Definitional Interpreters☆72Updated 7 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated 2 months ago