zachhalle / hotc
Notes on higher-order typed compilation. Probably wrong
☆23Updated 2 years ago
Alternatives and similar repositories for hotc
Users that are interested in hotc are comparing it to the libraries listed below
Sorting:
- Unification and type inference algorithms☆125Updated 10 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 3 months ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 years ago
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆23Updated 2 years ago
- Normalization by evaluation of simply typed combinators.☆26Updated 3 years ago
- Coq formalizations and proofs of (data) structures and algorithms.☆46Updated 7 years ago
- ☆55Updated last month
- SSA vs ANF☆42Updated 9 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆31Updated 6 months ago
- The MLPolyR programming language, revived☆24Updated 4 years ago
- Accompanying code for "Types and Programming Languages", ported to Standard ML☆30Updated 9 years ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆72Updated 7 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆45Updated 2 years ago
- Notes and handouts from OPLSS 2018☆55Updated 6 years ago
- Verified C programming in Agda☆16Updated 4 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated this week
- A command-line tool to generate Latex (inference rules) from inductive coq definitions.☆29Updated 8 years ago
- PL conference deadline countdowns☆60Updated last month
- Haskell implementation of the Edinburgh Logical Framework☆28Updated last week
- A monadic library for symbolic evaluation☆60Updated last week
- ☆36Updated 3 years ago
- ☆21Updated 3 years ago
- Deadlock freedom by type checking☆20Updated last year
- Types and Programming Languages☆38Updated 10 years ago
- Towards changing things and see if it proofs☆59Updated 3 years ago
- ☆23Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆29Updated 4 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago