No Cover Image

Book chapter 688 views

FunKons: Component-Based Semantics in K

Peter Mosses Orcid Logo, Ferdinand Vesely

Rewriting Logic and Its Applications, Volume: 8663, Pages: 213 - 229

Swansea University Authors: Peter Mosses Orcid Logo, Ferdinand Vesely

Full text not available from this repository: check for access using links below.

Abstract

Modularity has been recognised as a problematic issue of programming language semantics, and various semantic frameworks have been designed with it in mind. Reusability is another desirable feature which, although not the same as modularity, can be enabled by it. The K Framework, based on Rewriting...

Full description

Published in: Rewriting Logic and Its Applications
ISBN: 978-3-319-12903-7 978-3-319-12904-4
ISSN: 0302-9743 1611-3349
Published: WRLA 2014: Rewriting Logic and Its Applications 2014
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa48793
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract: Modularity has been recognised as a problematic issue of programming language semantics, and various semantic frameworks have been designed with it in mind. Reusability is another desirable feature which, although not the same as modularity, can be enabled by it. The K Framework, based on Rewriting Logic, has good modularity support, but reuse of specifications is not as well developed.The PLanCompS project is developing a framework providing an open-ended collection of reusable components for semantic specification. Each component specifies a single fundamental programming construct, or ‘funcon’. The semantics of concrete programming language constructs is given by translating them to combinations of funcons. In this paper, we show how this component-based approach can be seamlessly integrated with the K Framework. We give a component-based definition of CinK (a small subset of C++), using K to define its translation to funcons as well as the (dynamic) semantics of the funcons themselves.
College: College of Science
Start Page: 213
End Page: 229