zachhalle / hotcLinks
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:
- Types and Programming Languages☆37Updated 10 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A verified polyhedral scheduling validator in Coq.☆22Updated 9 months ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆73Updated 7 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 5 months ago
- Coq formalizations and proofs of (data) structures and algorithms.☆46Updated 7 years ago
- Course Webpage for B522 Programming Language Foundations, Spring 2020, Indiana University☆53Updated 5 years ago
- A formalization of the textbook Elements of Set Theory☆59Updated 3 years ago
- Educational Proof Assistant for Type Theory☆74Updated 11 months ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated last month
- A graduate seminar on SMT solving and solver-aided systems☆26Updated 3 years ago
- A monadic library for symbolic evaluation☆67Updated this week
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆23Updated 2 years ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 8 years ago
- Notes and handouts from OPLSS 2018☆55Updated 6 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆83Updated 5 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆45Updated 2 years ago
- SSA vs ANF☆43Updated 9 years ago
- Towards changing things and see if it proofs☆60Updated 4 years ago
- The Penn Locally Nameless Metatheory Library☆75Updated 3 months ago
- mirror of A simple type-theoretic language: Mini-TT☆39Updated 8 years ago
- ☆35Updated 9 months ago
- Normalization by evaluation of simply typed combinators.☆26Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Notes and handouts from OPLSS 2019☆34Updated 6 years ago
- Abstracting Definitional Interpreters☆68Updated 7 years ago
- Lecture material for DeepSpec Summer School 2017☆88Updated 3 years ago
- Benchmarks for capture-avoiding substitution☆119Updated last month
- A compiler for the gradually typed lambda calculus☆75Updated 3 years ago