6,396 research outputs found
Using Spoofax to Support Online Code Navigation
Get PDFSpoofax is a language workbench. A Spoofax language specification generally includes name resolution: the analysis of bindings between definitions and references. When browsing code in the specified language using Spoofax, the bindings appear as hyperlinks, supporting precise name-based code navigation. However, Spoofax cannot be used for browsing code in online repositories.
This paper is about a toolchain that uses Spoofax to generate hyperlinked twins of code repositories. These generated artefacts support the same precise code navigation as Spoofax, and can be browsed online. The technique has been prototyped on the CBS (Component-Based Semantics) specification language developed by the PLanCompS project, but could be used on any language after specifying its name resolution in Spoofax
Peter D. Mosses, _Action Semantics_
No full textThis is a review of Action Semantics, by Peter D. Mosses, Cambridge Tracts in Theoretical Computer Science 26, Cambridge University Press, 1992
Peter D. Mosses, _Action Semantics_
No full textThis is a review of Action Semantics, by Peter D. Mosses, Cambridge Tracts in Theoretical Computer Science 26, Cambridge University Press, 1992
Book Review -- Peter D. Mosses, Action Semantics
No full textThis is a review of Action Semantics, by Peter D. Mosses, published by Cambridge University Press in 1992
Using Spoofax to Support Online Code Navigation
No full textSpoofax is a language workbench. A Spoofax language specification generally includes name resolution: the analysis of bindings between definitions and references. When browsing code in the specified language using Spoofax, the bindings appear as hyperlinks, supporting precise name-based code navigation. However, Spoofax cannot be used for browsing code in online repositories. This paper is about a toolchain that uses Spoofax to generate hyperlinked twins of code repositories. These generated artefacts support the same precise code navigation as Spoofax, and can be browsed online. The technique has been prototyped on the CBS (Component-Based Semantics) specification language developed by the PLanCompS project, but could be used on any language after specifying its name resolution in Spoofax.Programming Language
Front Matter, Table of Contents, Preface, Conference Organization
No full textFront Matter, Table of Contents, Preface, Conference Organizatio
OASIcs, Volume 109, EVCS 2023, Complete Volume
No full textOASIcs, Volume 109, EVCS 2023, Complete Volum
A comparison of the moss floras of Chile and New Zealand
No full textChile and New Zealand share a common stock of 181 species of mosses in 94 genera and 34 families. This number counts for 23.3% of the Chilean and 34.6% of the New Zealand moss flora. If only species with austral distribution are taken into account, the number is reduced to 113 species in common, which is 14.5% of the Chilean and 21.6% of the New Zealand moss flora. This correlation is interpreted in terms of long distance dispersal resp. the common phytogeographical background of both countries as parts of the palaoaustral floristic region and compared with disjunct moss floras of other continents as well as the presently available molecular data
Modularity in Structural Operational Semantics (Extended Abstract)
No full text) Peter D. Mosses 1 Computer Science Laboratory SRI International 333 Ravenswood Avenue, Menlo Park, CA 94025, USA Abstract Modularity is an important pragmatic aspect of semantic descriptions: good modularity is needed to allow the reuse of existing descriptions when extending or changing the described language. In denotational semantics, the issue of modularity has received much attention, and appropriate abstractions have been introduced, so that definitions of semantic functions may be independent of the details of how computations are modelled. In structural operational semantics (SOS), however, this issue has largely been neglected, and SOS descriptions of programming languages typically exhibit rather poor modularity. This paper shows how to obtain a high degree of modularity in SOS. The main idea is quite simple: configurations are restricted to pure syntax---enriched, as usual, with computed values---and all the usual semantic components of configurations are incorporated in..
Foundations of Modular SOS (Extended Abstract)
No full text) Peter D. Mosses 1;2 1 BRICS and Department of Computer Science, University of Aarhus, Denmark 2 Visiting SRI International and Stanford University, USA Abstract. A novel form of labelled transition system is proposed, where the labels are the arrows of a category, and adjacent labels in computations are required to be composable. Such transition systems provide the foundations for modular SOS descriptions of programming languages. Three fundamental ways of transforming label categories, analogous to monad transformers, are provided, and it is shown that their applications preserve computations in modular SOS. The approach is illustrated with fragments taken from a modular SOS for ML concurrency primitives. 1 Introduction SOS (structural operational semantics) is a widely-used framework for defining process algebras [12, e.g.] and programming languages [13, e.g.]. Following Plotkin [22], SOS has often been preferred to the more abstract framework of denotational seman..
- …
