Abstract Machines for Game Semantics, Revisited

Fredriksson, Olle; Ghica, Dan R.

doi:10.1109/lics.2013.63

Cited by 17 publications

(17 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The language should still be a low level language, giving the user explicit control over low level details. Even though the proposed language is higher-order, it does not rely on garbage collection, much like [6]. We shall see that its types provide an analysis of the stack shape for any part of the program.…”

Section: Types For Interfaces and Stack Analysismentioning

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

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: Types For Interfaces and Stack Analysismentioning

confidence: 99%

“…Having noted the connection to game semantics, one may see the work in this paper as complementing existing work on using implementing game semantic models, such as [6,17].…”

Section: Introductionmentioning

confidence: 99%

Organising Low-Level Programs using Higher Types

Schöpp

2014

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

View full text Add to dashboard Cite

show abstract

“…We aim to be as generic as possible in this context. Some existing work uses as a starting point interaction-based semantic paradigms which lend themselves naturally to a communication-centric implementation: Geometry of Interaction [17] and Game Semantics [18]. Such approaches have two significant disadvantages.…”

Section: Native Rpc and Transparent Distributionmentioning

confidence: 99%

“…cit. it is argued that emulating a shared address space is infeasible since it requires each pointer to also contain location information, and that it is 16 Backup.soundness 17 Backup.completeness 18 Backup.fast-forward-to-crash questionable whether acceptable efficiency can be achieved. These arguments certainly apply to our work, where we do just this.…”

Section: Related Workmentioning

confidence: 99%

Towards native higher-order remote procedure calls

Fredriksson

Ghica

Wheen

2014

Proceedings of the 26nd 2014 International Symposium on Implementation and Application of Functional Languages

Self Cite

View full text Add to dashboard Cite

We present a new abstract machine, called DCESH, which models the execution of higher-order programs running in distributed architectures. DCESH implements a native general remote higherorder function call across node boundaries. It is a modernised version of SECD enriched with specialised communication features required for implementing the remote procedure call mechanism. The key correctness result is that the termination behaviour of the remote procedure call is indistinguishable (bisimilar) to that of a local call. The correctness proofs and the requisite definitions for DCESH and other related abstract machines are formalised using Agda. We also formalise a generic transactional mechanism for transparently handling failure in DCESHs.We use the DCESH as a target architecture for compiling a conventional call-by-value functional language ("Floskel") which can be annotated with node information. Conventional benchmarks show that the single-node performance of Floskel is comparable to that of OCaml, a semantically similar language, and that distribution overheads are not excessive. Native RPC and transparent distributionThe remote procedure call (RPC) [7] is a widely used mechanism for higher-level inter-process communication. An RPC is what its name suggests: a call to a procedure located on a remote node. The idea is that an RPC looks and acts like an ordinary procedure call, and performs the necessary message passing under the hood. However, the RPC mechanism tends to be bolted on top of a pre-existing language, as a library for example, rather than be seamlessly integrated into it. This leads to significant syntactic differences between calling a local library function and a remote function. Even if these syntactic differences can be smoothed using stubs that wrap remote calls into local calls [6] important differences still persist, of which the most important is that arguments must be of ground types.Generalising RPC to all types and incorporating it seamlessly in the language has been considered but dismissed on grounds of potential inefficiencies [40]. However, considering that a number of technologies that trade efficiency for convenience have been rejected on similar grounds (from machine independent languages to functional programming, garbage collection or automated program verification -to name only a few), we decided it is time to revisit Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. IFL '14, October 1-3, 2014, Boston, MA, USA. Copyright c 20yy ACM 978-1-nnnn-nnnn-n/yy/...

show abstract

“…A number of authors, e.g. [10,11,7,9], have used semantic models related to game semantics to design compilation methods with various resource usage guarantees. Game semantics explains higher-order computation by interaction dialogues and can be used to organise low-level programs into semantic models.…”

Section: Introductionmentioning

confidence: 99%

Call-by-Value in a Basic Logic for Interaction

Schöpp

2014

Programming Languages and Systems

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

Abstract Machines for Game Semantics, Revisited

Cited by 17 publications

References 24 publications

Organising Low-Level Programs using Higher Types

Organising Low-Level Programs using Higher Types

Towards native higher-order remote procedure calls

Call-by-Value in a Basic Logic for Interaction

Contact Info

Product

Resources

About