A high-level functional programming language for interaction nets
Interaction nets are a type of graph rewrite system. Introduced initially as the basis for a new programming paradigm, they have attractive properties, including automatic memory management, direct manipulation of data structures, natural parallelism and opportunities for a visual programming style. However, their main contributions have been investigating computation models, most notably in the optimal reduction of lambda-calculus expressions. Interaction net programming languages have been worked on for over 30 years but remain low-level. We are working on a new approach, using functional programming techniques, to create a high-level language that is isomorphic to interaction nets and their rules.
Tue 18 JulDisplayed time zone: London change
15:30 - 17:00 | GCM Session 3GCM at Willow Chair(s): Jens Kosiol Universität Kassel Remote Participants: Zoom Link, YouTube Livestream | ||
15:30 7mTalk | A high-level functional programming language for interaction nets GCM | ||
15:38 7mTalk | Finite Automata for Efficient Graph Recognition GCM Frank Drewes Umeå universitet, Berthold Hoffmann Universität Bremen, P: Mark Minas Universität der Bundeswehr München | ||
15:45 7mTalk | Towards Efficient Boltzmann Sampling with Graph Generative Models and Constraints GCM | ||
15:53 7mTalk | Random Graph Generation in Context-Free Graph Languages GCM | ||
16:00 60mOther | Open Discussion GCM |