Call-by-Value in a Basic Logic for Interaction

Schöpp, Ulrich

doi:10.1007/978-3-319-12736-1_23

Cited by 8 publications

(7 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It supports separate compilation and its structure can be seen as reconstructing calls from jumps. We have developed a variant of relational parametricity for INT, which is useful to prove the soundness of embeddings of higher languages into INT, see [26] for a report on intended applications. In further work, it should be interesting to compare the approach to existing approaches to relational parametricity and control, such as [10,18].…”

Section: Resultsmentioning

confidence: 99%

“…One main motivation for studying INT is also to develop a calculus for reasoning about low-level programs. Ongoing work on intended applications of such a calculus is reported in [26]. We would like to define a notion of equality for INT that is useful for reasoning about low-level programs.…”

Section: Equational Reasoningmentioning

confidence: 99%

“…The particular new features of INT were motivated by an ongoing investigation of closure conversion with a subsystem of INT as the target language, see [26]. This work goes toward assessing how useful a higher-order typed language such as INT is for encoding higher languages and for proving the encoding correct.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Organising Low-Level Programs using Higher Types

Schöpp

2014

Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming

Self Cite

View full text Add to dashboard Cite

Type systems that allow control over low-level compilation details have been developed in the context of resource aware compilation, e.g. for circuit synthesis or for programming with logarithmic space. It was recently observed that some compilation techniques developed in this context, while motivated by capturing certain resource usage restrictions, are closely related to standard compilation techniques, such as CPS translation and defunctionalization. Previous results of this kind suggest to investigate type systems for resource aware compilation more generally with regard to their applicability to structuring general low-level languages, e.g. as used in compilers.In this paper we study how ideas developed for the LOGSPACE type system INTML can be used for organising the programs in a first-order low-level language. We do so using a type system that simplifies and extends INTML, in particular with parametric polymorphism. The type system is simple but flexible, allowing the definition of combinators, such as for tail recursion, recursion, mutable variables or coroutines, in the language itself. We show that it supports separate compilation and consider its performance using an experimental implementation. For reasoning about the low-level programs represented in the type system, we develop an equational theory based on relational parametricity.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Equational Reasoningmentioning

confidence: 99%

See 1 more Smart Citation

Organising Low-Level Programs using Higher Types

Schöpp

2014

Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…The GoI-style token passing itself has been adapted to implement the call-by-value evaluation strategy. Apart from the abstract machine with jumps [11] already mentioned, known adaptations [24,16] commonly use the CPS transformation [23], with the focus on correctness. However this method naively leads to an abstract machine with inefficient overhead cost [16].…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Efficient Implementation of Evaluation Strategies via Token-Guided Graph Rewriting

Muroya¹,

Ghica²

2018

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

In implementing evaluation strategies of the lambda-calculus, both correctness and efficiency of implementation are valid concerns. While the notion of correctness is determined by the evaluation strategy, regarding efficiency there is a larger design space that can be explored, in particular the trade-off between space versus time efficiency. We contributed to the study of this trade-off by the introduction of an abstract machine for call-by-need, inspired by Girard's Geometry of Interaction, a machine combining token passing and graph rewriting. This work presents an extension of the machine, to additionally accommodate left-to-right and right-to-left call-by-value strategies. We show soundness and completeness of the extended machine with respect to each of the call-by-need and two call-by-value strategies. Analysing time cost of its execution classifies the machine as "efficient" in Accattoli's taxonomy of abstract machines.

show abstract

“…As in games [2], call-by-value requires a more sophisticated machinery to be handled by GoI. This machinery, almost invariably, relies on effects [13], [23], even when the underlying language is purely functional. This paper suggests an alternative route, which consists in making the underlying machine parallel, nodes staying stateless.…”

Section: Related Workmentioning

confidence: 99%

Parallelism and Synchronization in an Infinitary Context

Lago

Faggian²,

Valiron³

et al. 2015

2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science

View full text Add to dashboard Cite

International audienceWe study multitoken interaction machines in the context of a very expressive linear logical system with expo-nentials, fixpoints and synchronization. The advantage of such machines is to provide models in the style of the Geometry of Interaction, i.e., an interactive semantics which is close to low-level implementation. On the one hand, we prove that despite the inherent complexity of the framework, interaction is guaranteed to be deadlock-free. On the other hand, the resulting logical system is powerful enough to embed PCF and to adequately model its behaviour, both when call-by-name and when call-by-value evaluation are considered. This is not the case for single-token stateless interactive machines

show abstract

Call-by-Value in a Basic Logic for Interaction

Cited by 8 publications

References 28 publications

Organising Low-Level Programs using Higher Types

Organising Low-Level Programs using Higher Types

Efficient Implementation of Evaluation Strategies via Token-Guided Graph Rewriting

Parallelism and Synchronization in an Infinitary Context

Contact Info

Product

Resources

About