Abstract machines, optimal reduction, and streams
| Autor: | Mario Piazza, Anna Chiara Lai, Marco Pedicini |
|---|---|
| Přispěvatelé: | Lai, Anna Chiara, Pedicini, Marco, Piazza, Mario, Chiara Lai, Anna |
| Jazyk: | angličtina |
| Rok vydání: | 2019 |
| Předmět: |
Geometry of interaction
Functional programming Theoretical computer science Settore INF/01 - Informatica business.industry Computer science Linear logic Abstract machine Curry–Howard correspondence Computer Science Applications Mathematics (miscellaneous) Software Geometry of the interaction Parallel Implementation Functional Programming Streams Linear Logic Curry-Howard Isomorphism Geometry of Interaction Parallel Implementation Functional Programming Streams Linear Logic Curry-Howard Isomorphism Curry-Howard Isomorphism Functional Programming Geometry of Interaction Linear Logic Parallel Implementation Streams Equivalence (formal languages) Lambda calculus business computer computer.programming_language Settore M-FIL/02 - Logica e Filosofia della Scienza |
| Popis: | In this paper, we propose and explore a new approach to abstract machines and optimal reduction via streams, infinite sequences of elements. We first define a sequential abstract machine capable of performing directed virtual reduction (DVR) and then we extend it to its parallel version, whose equivalence is explained through the properties of DVR itself. The result is a formal definition of the λ-calculus interpreter called Parallel Environment for Lambda Calculus Reduction (PELCR), a software for λ-calculus reduction based on the Geometry of Interaction. In particular, we describe PELCR as a stream-processing abstract machine, which in principle can also be applied to infinite streams. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|