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:
- Coq formalizations and proofs of (data) structures and algorithms.☆47Updated 7 years ago
- Educational Proof Assistant for Type Theory☆81Updated 2 weeks ago
- Course Webpage for B522 Programming Language Foundations, Spring 2020, Indiana University☆55Updated 5 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A graduate seminar on SMT solving and solver-aided systems☆28Updated 3 years ago
- Abstracting Definitional Interpreters☆74Updated 8 years ago
- ☆53Updated last month
- A monadic library for symbolic evaluation☆73Updated 4 months ago
- A verified polyhedral scheduling validator in Coq.☆23Updated last year
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆26Updated 3 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆74Updated 7 years ago
- ☆25Updated 5 years ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated last week
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆86Updated 5 years ago
- Types and Programming Languages☆37Updated 11 years ago
- A formalization of the textbook Elements of Set Theory☆59Updated 4 years ago
- Coq code and exercises from the Coq'Art book [maintainers=@ybertot,@Casteran]☆127Updated 9 months ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated 2 weeks ago
- SSA vs ANF☆47Updated 10 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆84Updated 9 years ago
- A compiler for the gradually typed lambda calculus☆76Updated 4 years ago
- ☆234Updated last year
- A command-line tool to generate Latex (inference rules) from inductive coq definitions.☆30Updated 9 years ago
- The Penn Locally Nameless Metatheory Library☆76Updated 8 months ago
- Coq formalizations of functional languages.☆145Updated 5 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆47Updated 3 years ago
- ☆15Updated last year
- Best of POPL (BOP) Reading Group Memoirs☆67Updated 3 years ago