-
Notifications
You must be signed in to change notification settings - Fork 400
HVM Wiki
Boscop edited this page May 11, 2023
·
8 revisions
- https://zicklag.github.io/blog/interaction-nets-combinators-calculus
- https://github.com/HigherOrderCO/HVM/blob/master/guide/HOW.md
- Twitter thread: https://twitter.com/VictorTaelin/status/1588332432587005952
- https://github.com/VictorTaelin/HOC/blob/master/summary_for_gpt.txt
- Yves Lafont's paper on Interaction Combinators from 1997: https://www.semanticscholar.org/paper/Interaction-Combinators-Lafont/6cfe09aa6e5da6ce98077b7a048cb1badd78cc76
- Formalization of the Interaction Calculus in Kind: https://github.com/HigherOrderCO/Wikind/blob/master/IC/_.kind2
- Other blog posts tagged by zicklag tagged #HVM: https://zicklag.github.io/blog/tags/hvm/
- This book contains the optimal beta-reduction algorithm: The Optimal Implementation of Functional Programming Languages
- Yves Lafont - Interaction nets (1989) https://dl.acm.org/doi/10.1145/96709.96718
- Optimal reductions in the lambda calculus: http://pauillac.inria.fr/~levy/confer-2/ppr1/node61.html
- Levy, optimal reductions in the lambda calculus: https://pauillac.inria.fr/~levy/pubs/80curry.pdf
- John Lamping's abstract algorithm for optimal beta reduction: https://dl.acm.org/doi/abs/10.1145/96709.96711
- An Overview of Lambda-Calculus Optimal Reductions and of their Implementation: https://cs.au.dk/~gerth/MC/99/LambdaReduction/index.html
- Optimality and inefficiency: what isn't a cost model of the lambda calculus? https://dl.acm.org/doi/10.1145/232629.232639
- This video from Yves Lafont (1995) shows some interaction net reductions (only visual, without explanation): https://www.youtube.com/watch?v=_uIGQ1biCXY
- Complete example of λ-Terms reduction using Interaction Combinators (with explanation in Portuguese, but understandable with English subtitles enabled, after you've familiarized yourself with the terminology): https://www.youtube.com/watch?v=Su6-xTouDGk
- The Symmetric Interaction Calculus
- Functions may behave as if they had negative complexity on optimal evaluators
- Solving the mystery behind Abstract Algorithm’s magical optimizations
- Beyond inductive datatypes exploring Self types
- https://github.com/VictorTaelin/absal-ex
- https://github.com/VictorTaelin/absal-rs
- https://github.com/VictorTaelin/Symmetric-Interaction-Calculus
- https://github.com/VictorTaelin/abstract-algorithm
- https://github.com/MaisaMilena/Formality-Net-Animator
- https://github.com/VictorTaelin/Formality
- https://github.com/Soonad/Formality-Core
- https://github.com/VictorTaelin/LPU
- https://github.com/VictorTaelin/parallel_lambda_computer_tests
- Yves Lafont's original website: https://web.archive.org/web/20171209023501/http://iml.univ-mrs.fr/~lafont/recherche.html
- The Binary Lambda Calculus: https://tromp.github.io/cl/cl.html
- Chemlambda: https://chemlambda.github.io/index.html
- Interaction nets: programming language design and implementation https://www.user.tu-berlin.de/o.runge/tfs/workshops/gtvmt08/Program/paper_38.pdf
- Design and implementation of a low-level language for interaction nets: https://core.ac.uk/download/pdf/30611893.pdf
- Macros for Interaction Nets: http://www.lsv.fr/Publis/PAPERS/PDF/SM-tg04.pdf
- Extensions for Interaction Nets (about nested pattern matching) https://publik.tuwien.ac.at/files/PubDat_194660.pdf
- Partial Evaluation for Interaction nets: http://pagesperso.ls2n.fr/~bechet-d/Documents/LIENS-1992-Bec-WSA92-recompiled-2003-07-22-draft.pdf
- An Implementation Model for Interaction Nets: https://cgi.cse.unsw.edu.au/~eptcs/paper.cgi?TERMGRAPH2014.5.pdf