Encontrados 8 documentos, a visualizar página 1 de 1
Iterators and interaction
Mackie, Ian; Pinto, Jorge Sousa; Vilaça, MiguelEigth International Workshop on Computing with Terms and Graphs (TERMGRAPH’09), 2009 ; We propose a method for encoding iterators (and recursion operators in general) using interaction nets. There are two main applications for this: the method can be used to obtain a visual notation for functional programs, in a visual programming system; and it can be used to extend the existing translations of the λ-calculus...
Visual programming with Interaction Nets
Hassan, Abubakar; Mackie, Ian; Pinto, Jorge SousaProgramming directly with diagrams offers potential advantages such as visual intuitions, identification of errors (debugging), and insight into the dynamics of the algorithm. The purpose of this paper is to put forward one particular graphical formalism, interaction nets, as a candidate for visual programming which has not only all the desired properties that one would expect, but also has other benefits as a ...
Visual programming with recursion patterns in interaction nets
Mackie, Ian; Pinto, Jorge Sousa; Vilaça, MiguelIn this paper we propose to use Interaction Nets as a formalism for Visual Functional Programming. We consider the use of recursion patterns as a programming idiom, and introduce a suitable archetype/instantiation mechanism for interaction agents, which allows one to define agents whose behaviour is based on recursion patterns.
Visual programming with recursion patterns in interaction nets
Mackie, Ian; Pinto, Jorge Sousa; Vilaça, MiguelIn this paper we propose to use Interaction Nets as a formalism for Visual Functional Programming. We consider the use of recursion patterns as a programming idiom, and introduce a suitable archetype/instantiation mechanism for interaction agents, which allows one to define agents whose behaviour is based on recursion patterns.
Functional programming and program transformation with interaction nets
Mackie, Ian; Pinto, Jorge Sousa; Vilaça, MiguelTechon. Report DI-PURe 05.05.02. ; In this paper we propose to use Interaction Nets as a formalism for Visual Functional Programming. We consider the use of recursion patterns and introduce a suitable archetype/instantiation mechanism for interaction agents. We also consider program transformation by fusion, a well-known transformation technique, and show that this extends smoothly to our visual programming fr...
Encoding linear logic with interaction combinators
Mackie, Ian; Pinto, Jorge SousaThe purpose of this paper is to demonstrate how Lafont’s interaction combinators, a system of three symbols and six interaction rules, can be used to encode linear logic. Specifically, we give a translation of the multiplicative, exponential and additive fragments of linear logic together with a strategy for cut-elimination which can be faithfully simulated. Finally, we show briefly how this encoding can be use...
A higher-order calculus for graph transformation
Fernández, Maribel; Mackie, Ian; Pinto, Jorge SousaThis paper presents a formalism for defining higher-order systems based on the notion of graph transformation (by rewriting or interaction). The syntax is inspired by the Combinatory Reduction Systems of Klop. The rewrite rules can be used to define first-order systems, such as graph or term-graph rewriting systems, Lafont's interaction nets, the interaction systems of Asperti and Laneve, the non-deterministic...
Combining interaction nets with externally defined programs
Fernández, Maribel; Mackie, Ian; Pinto, Jorge SousaMany calculi, for instance the lambda-calculus and term rewriting systems, have benefitted from extensions, especially to include data structures and operations which are more naturally defined in another language. A simple example of this is PCF where the lambda-calculus is extended to include natural numbers and some basic functions over this type, which avoids having to use inefficient encodings of numbers. ...
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||