Age | Commit message (Collapse) | Author | |
---|---|---|---|
2025-01-07 | Add quotation to help metaprogramming. | Greg Brown | |
2024-11-20 | Improve syntactic sugar. | Greg Brown | |
Sugar makes programs nicer to write. | |||
2024-11-18 | Better type errors within lets. | Greg Brown | |
2024-11-18 | Preserve some comments when pretty printing. | Greg Brown | |
2024-11-15 | Add compilation to scheme. | Greg Brown | |
Extract parser as an independent project. | |||
2024-11-12 | Fix bad annotation when desugaring map. | Greg Brown | |
2024-11-12 | Add more names. Names are good. | Greg Brown | |
2024-11-12 | Add ability to desugar terms. | Greg Brown | |
Remove `getChildren` construct---it's too niche for the core language. | |||
2024-10-30 | Define well-formedness for types. | Greg Brown | |
2024-10-29 | Write a fuelled reducer for System T. | Greg Brown | |
2024-10-29 | Print type checking errors. | Greg Brown | |
2024-10-28 | Improve pretty printer. | Greg Brown | |
2024-10-28 | Make everything relevant. | Greg Brown | |
Too few proofs were relevant. Now they are. | |||
2024-10-09 | Do a lot. | Greg Brown | |
- Add type aliases. - Make `suc` a symbol. - Fix incorrect specification for `IsFunction`. - Write parser for terms. - Use `collie` to improve command line experience. | |||
2024-09-30 | Make tags for tuples and cases unique. | Greg Brown | |
2024-09-20 | Get working type pretty printer. | Greg Brown | |
Write a type on stdin, and it will tell you if it's well formed, and will pretty print it back if so. Rewrite the parser library to be n-ary. | |||
2024-09-17 | Introduce names in contexts. | Greg Brown | |
Introduce rows for n-ary sums and products. Remove union types. | |||
2024-09-13 | Define parser infrastructure. | Greg Brown | |
2024-09-13 | Define pretty printers for terms and types. | Greg Brown | |
2024-09-12 | Make naturals a fixpoint type. | Greg Brown | |
This removes the need for a custom fold on naturals. | |||
2024-09-11 | Define terms. | Greg Brown | |
2024-09-10 | Make arrows binary, not n-ary. | Greg Brown | |
Define decidable equality. | |||
2024-09-09 | Restart. | Greg Brown | |
- use De Bruijn, as Namely, Painless had more pain than promised; - remove higher-kinded types; - provide ill-typing predicates; - prove substitution respects ill-typing; | |||
2024-09-02 | Make sum types n-ary. | Greg Brown | |
2024-09-02 | Add sum and product types. | Greg Brown | |
2024-09-02 | Remove unnecessary `where`. | Greg Brown | |
2024-09-02 | Define a type of well-kinded types. | Greg Brown | |
2024-08-14 | Add more DeBruijn utilities. | Greg Brown | |
2024-08-14 | Define kinds and monotypes. | Greg Brown | |
2024-08-14 | Define environments over worlds. | Greg Brown | |
2024-08-06 | Define traversal kits. | Greg Brown | |
2024-08-05 | Define nominal, painless binding. | Greg Brown | |