Iterators and interaction

Eigth International Workshop on Computing with Terms and Graphs (TERMGRAPH’09), 2009We 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 into interaction nets (that have been proposed as efficient implementation mechanisms) to languages with recursive types. This work can also be seen as a study of the relation between interaction net programming and functional programming

Token-passing nets for functional languages

Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2007)Token-passing nets were proposed by Sinot as a simple mechanism for encoding evaluation strategies for the λ-calculus in interaction nets. This work extends token-passing nets to cover a typed functional language equipped with structured types and unrestricted recursion. The resulting interaction system is derived systematically from the chosen big-step operational semantics. Along the way, we actually characterize and discuss several design decisions of token-passing nets and extend them in order to achieve simpler interaction net systems with a higher degree of embedded parallelism.Fundação para a Ciência e a Tecnologia (FCT

Recursion in cognition: a computational investigation into the representation and processing of language

La recursividad entendida como auto-referencia se puede aplicar a varios constructos de las ciencias cognitivas, como las definiciones teóricas, los procedimientos mecánicos, los procesos de cálculo (sean éstos abstractos o concretos) o las estructuras. La recursividad es una propiedad central tanto del procedimiento mecánico que subyace a la facultad del lenguaje como de las estructuras que esta facultad genera. Sin embargo, tanto las derivaciones sintácticas de la gramática, que constituyen un proceso computacional abstracto, como las estrategias de procesamiento del parser, que son un proceso en tiempo real, proceden de forma iterativa, lo cual sugiere que la especificación recursiva de un algoritmo se implementa de forma iterativa. Además, la combinación de la recursividad con las unidades léxicas y las imposiciones de los interfaces con los que la facultad del lenguaje interactúa resulta en un conjunto de estructuras sui generis que no tienen parangón en otros dominios cognitivos.Recursion qua self-reference applies to various constructs within the cognitive sciences, such as theoretical definitions, mechanical procedures (or algorithms), (abstract or real-time) computational processes and structures. Recursion is an intrinsic property of both the mechanical procedure underlying the language faculty and the structures this faculty generates. However, the recursive nature of the generated structures and the recursive character of the processes need to be kept distinct, their study meriting individual treatment. In fact, the nature of both the syntactic derivations of the grammar (an abstract computational process) and the processing strategies of the parser (a real-time process) are iterative, which suggests that recursively-defined algorithms are implemented iteratively in linguistic cognition. Furthermore, the combination of recursion, lexical items and the impositions of the interfaces the language faculty interacts with results in a sui generis set of structures with which other domains of the mind bear the most superficial of relations

Programming Languages and Systems

This open access book constitutes the proceedings of the 28th European Symposium on Programming, ESOP 2019, which took place in Prague, Czech Republic, in April 2019, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019