diff options
| author | Marvin Borner | 2023-01-31 06:05:19 +0100 |
|---|---|---|
| committer | Marvin Borner | 2023-01-31 06:05:19 +0100 |
| commit | 6e8596cc1a259169b173d617a0135daa8ae1cb45 (patch) | |
| tree | 835fc3562fa909a843c54b66283d52761c8d9d3f /readme.md | |
| parent | 2eecfca85b2b703318e57fcce33c864757b79c00 (diff) | |
Fixed building/syncing
Diffstat (limited to 'readme.md')
| -rw-r--r-- | readme.md | 38 |
1 files changed, 37 insertions, 1 deletions
@@ -1,3 +1,39 @@ # MILCR -> **M**ultithreaded **I**nteraction net **L**ambda **C**alculus **R**educer +> **M**ultithreaded graphically-**I**nduced **L**ambda **C**alculus +> **R**educer + +- Strong reduction (reduction inside abstractions) of call-by-need + lambda calculus +- Originally intended as reducer of the `bruijn` programming language +- Useful for proof assistants or as a high-level lambda-term reducer + of functional programming languages +- Based on bleeding-edge research results + +## Research + +In no particular order: + +0. Biernacka, M., Charatonik, W., & Drab, T. (2022). A simple and + efficient implementation of strong call by need by an abstract + machine. Proceedings of the ACM on Programming Languages, 6(ICFP), + 109-136. +1. Accattoli, B., Condoluci, A., & Coen, C. S. (2021, June). Strong + call-by-value is reasonable, implosively. In 2021 36th Annual + ACM/IEEE Symposium on Logic in Computer Science (LICS) (pp. 1-14). + IEEE. +2. Balabonski, T., Lanco, A., & Melquiond, G. (2021). A strong + call-by-need calculus. arXiv preprint arXiv:2111.01485. +3. Accattoli, B., Condoluci, A., Guerrieri, G., & Coen, C. S. (2019, + October). Crumbling abstract machines. In Proceedings of the 21st + International Symposium on Principles and Practice of Declarative + Programming (pp. 1-15). +4. Accattoli, B., & Coen, C. S. (2015, July). On the relative + usefulness of fireballs. In 2015 30th Annual ACM/IEEE Symposium on + Logic in Computer Science (pp. 141-155). IEEE. +5. Condoluci, A., Accattoli, B., & Coen, C. S. (2019, October). Sharing + equality is linear. In Proceedings of the 21st International + Symposium on Principles and Practice of Declarative Programming + (pp. 1-14). +6. Accattoli, B., & Leberle, M. (2021). Useful open call-by-need. arXiv + preprint arXiv:2107.06591. |