TL;DR
This paper provides a Russian translation of a chapter on interaction nets, a graphical model of computation based on interaction, useful for defining algorithms, analyzing costs, and low-level language compilation.
Contribution
It offers a Russian translation of a key chapter on interaction nets, facilitating access to this computational model for Russian-speaking researchers.
Findings
Interaction nets are a graphical model based on interaction.
They can be used to define algorithms and analyze their cost.
Interaction nets can be efficiently implemented.
Abstract
Draft translation to Russian of Chapter 7, Interaction-Based Models of Computation, from Models of Computation: An Introduction to Computability Theory by Maribel Fernandez. "In this chapter, we study interaction nets, a model of computation that can be seen as a representative of a class of models based on the notion of 'computation as interaction'. Interaction nets are a graphical model of computation devised by Yves Lafont in 1990 as a generalisation of the proof structures of linear logic. It can be seen as an abstract formalism, used to define algorithms and analyse their cost, or as a low-level language into which other programming languages can be compiled. This is fruitful because interaction nets can be implemented with reasonable efficiency."
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Computability, Logic, AI Algorithms · Logic, Reasoning, and Knowledge