Organising Low-Level Programs using Higher Types

Schöpp, Ulrich

doi:10.1145/2643135.2643151

Cited by 5 publications

(4 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It was inspired by Melliès' Tensorial Logic [18,17]. We can give here only a concise definition of bare LIN; a richer intermediate language, defined not solely for the study of call-by-value, is described in detail in [24].…”

Section: A Basic Linear Intermediate Languagementioning

confidence: 99%

“…It is possible to define equality for derivations and show coherence, i.e. that two derivations of the same derivation have equal interpretations, see [24] for more details. For the results in this paper, it would be just as well to work with derivations and without coherence, so we do not spell this out.…”

Section: Equational Theorymentioning

confidence: 99%

“…It turns out that one obtains efficient compilation methods that are related to standard techniques in the compilation of programming languages, such as CPS-translation and defunctionalization [23]. The translation from PCF to the interactive model can be seen as a thunkifying translation [13] into an intermediate language, such as the one described in [24], and correctness follows immediately from equations in the intermediate language.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Call-by-Value in a Basic Logic for Interaction

Schöpp

2014

Programming Languages and Systems

Self Cite

View full text Add to dashboard Cite

Abstract. In game semantics and related approaches to programming language semantics, programs are modelled by interaction dialogues. Such models have recently been used by a number of authors for the design of compilation methods, in particular for applications where resource control is important. The work in this area has focused on call-by-name languages. In this paper we study the compilation of call-by-value into a first-order low-level language by means of an interpretation in a semantic interactive model. We refine the methods developed for call-by-name languages to allow an efficient treatment of call-by-value. We introduce an intermediate language that is based on the structure of an interactive computation model and that can be seen as a fragment of Linear Logic. The main result is that Plotkin's call-by-value CPS-translation and its soundness proof can be refined to target this intermediate language. This refined CPS-translation amounts to a direct compilation of the source language into a first-order language.

show abstract

Section: A Basic Linear Intermediate Languagementioning

confidence: 99%

Section: Equational Theorymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Call-by-Value in a Basic Logic for Interaction

Schöpp

2014

Programming Languages and Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…Token-passing GoI decomposes higher-order computation into local token actions, or low-level interactions of simple components. It can give strikingly innovative implementation techniques for functional programs, such as Mackie's Geometry of Implementation compiler [20], Ghica's Geometry of Synthesis (GoS) high-level synthesis tool [12], and Schöpp's resource-aware program transformation to a low-level language [25]. The interactionbased approach is also convenient for the complexity analysis of programs, e.g.…”

Section: Introduction 1token-passing Abstract Machines For λ-Calculusmentioning

confidence: 99%

The Dynamic Geometry of Interaction Machine: A Call-by-need Graph Rewriter

Muroya,

Ghica

2017

Preprint

View full text Add to dashboard Cite

Girard's Geometry of Interaction (GoI), a semantics designed for linear logic proofs, has been also successfully applied to programming language semantics. One way is to use abstract machines that pass a token on a fixed graph along a path indicated by the GoI. These token-passing abstract machines are space efficient, because they handle duplicated computation by repeating the same moves of a token on the fixed graph. Although they can be adapted to obtain sound models with regard to the equational theories of various evaluation strategies for the lambda calculus, it can be at the expense of significant time costs. In this paper we show a token-passing abstract machine that can implement evaluation strategies for the lambda calculus, with certified time efficiency. Our abstract machine, called the Dynamic GoI Machine (DGoIM), rewrites the graph to avoid replicating computation, using the token to find the redexes. The flexibility of interleaving token transitions and graph rewriting allows the DGoIM to balance the trade-off of space and time costs. This paper shows that the DGoIM can implement call-by-need evaluation for the lambda calculus by using a strategy of interleaving token passing with as much graph rewriting as possible. Our quantitative analysis confirms that the DGoIM with this strategy of interleaving the two kinds of possible operations on graphs can be classified as "efficient" following Accattoli's taxonomy of abstract machines.But if GoI-style techniques are to be used in a practical setting they need to extend beyond call-by-name, not just correctly but also efficiently. Interleaving Token Passing with Graph RewritingA token jumping, rather than following a path, can be seen as a simple form of short-circuiting that path, which is a simple form of graph-rewriting. This idea first occurs in Mackie's work as a compiler optimisation technique [20] and is analysed in more depth theoretically by Danos and Regnier in the so-called Interaction Abstract Machine [9]. More general graph-rewriting-based semantics have been used in a system called virtual reduction [8], where rewriting occurs along paths indicated by GoI, but without any token-actions. The most operational presentation of the combination of token-passing and jumping was given by Fernández and Mackie [11]. The interleaving of token actions and rewriting is also found in Sinot's interaction nets [26,27]. We can reasonably think of the DGoIM as their abstract-machine realisation.We build on these prior insights by adding more general, yet still efficient, graph-rewriting facilities to the setting of a GoI token-passing abstract machine. We call an abstract machine that interleaves token passing with graph rewriting the Dynamic GoI Machine (DGoIM), and we define it as a state transition system with transitions for token passing as well as transitions for graph rewriting. What connects these two kinds of transitions is the token trajectory through the graph, its path. By examining it, the DGoIM can detect redexes and trigger rewriting actions.T...

show abstract

From Call-by-Value to Interaction by Typed Closure Conversion

Schöpp

2015

Programming Languages and Systems

View full text Add to dashboard Cite

Organising Low-Level Programs using Higher Types

Cited by 5 publications

References 26 publications

Call-by-Value in a Basic Logic for Interaction

Call-by-Value in a Basic Logic for Interaction

The Dynamic Geometry of Interaction Machine: A Call-by-need Graph Rewriter

From Call-by-Value to Interaction by Typed Closure Conversion

Contact Info

Product

Resources

About