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
- Unification and type inference algorithms☆124Updated 9 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 4 months ago
- Normalization by evaluation of simply typed combinators.☆26Updated 2 years ago
- Coq formalizations and proofs of (data) structures and algorithms.☆46Updated 6 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 years ago
- Towards changing things and see if it proofs☆59Updated 3 years ago
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆22Updated 2 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆44Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆91Updated 2 weeks ago
- mirror of A simple type-theoretic language: Mini-TT☆38Updated 7 years ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 8 years ago
- Notes and handouts from OPLSS 2018☆53Updated 6 years ago
- Accompanying code for "Types and Programming Languages", ported to Standard ML☆30Updated 9 years ago
- The MLPolyR programming language, revived☆24Updated 4 years ago
- A monadic library for symbolic evaluation☆58Updated last week
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- Types and Programming Languages☆37Updated 10 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆54Updated 3 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆54Updated 4 months ago
- PL conference deadline countdowns☆54Updated this week
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- Course Webpage for B522 Programming Language Foundations, Spring 2020, Indiana University☆53Updated 4 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆72Updated 6 years ago
- The Penn Locally Nameless Metatheory Library☆74Updated 7 months ago
- a proof-of-concept programming language based on Call-by-push-value☆53Updated last month
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated 3 months ago
- ☆21Updated 3 years ago
- A deterministic parser with fused lexing☆72Updated last year