Action Semantics

Mosses, Peter D.

doi:10.1017/cbo9780511569869

Cited by 87 publications

(60 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The architecture of AM 2 is based on the meta-programming paradigm, which is largely used to program AAs. And there are programming languages based on a framework that can already be interpreted in terms of AbS (Mosses, 1992).…”

Section: Conclusion: From Grounding To Communicatingmentioning

confidence: 99%

A Praxical Solution of the Symbol Grounding Problem

Taddeo

Floridi

2007

Minds & Machines

View full text Add to dashboard Cite

This article is the second step in our research into the Symbol Grounding Problem (SGP). In a previous work, we defined the main condition that must be satisfied by any strategy in order to provide a valid solution to the SGP, namely the zero semantic commitment condition (Z condition). We then showed that all the main strategies proposed so far fail to satisfy the Z condition, although they provide several important

show abstract

Section: Conclusion: From Grounding To Communicatingmentioning

confidence: 99%

A Praxical Solution of the Symbol Grounding Problem

Taddeo

Floridi

2007

Minds & Machines

View full text Add to dashboard Cite

show abstract

“…This idea was tested on Pascal [22] and Standard ML [28]. Again, these tests demonstrated that action semantics is usable.…”

Section: Applicationsmentioning

confidence: 99%

“…The first such test was an ASD of Pascal developed by Peter and me [22]. This was followed by ASDs of various imperative, object-oriented, functional, and concurrent programming languages, including CCS and CSP [4], Java [3], and Standard ML [28].…”

Section: Applicationsmentioning

confidence: 99%

Action Semantics in Retrospect

Watt

2009

Semantics and Algebraic Specification

View full text Add to dashboard Cite

Abstract. This paper is a themed account of the action semantics project, which Peter Mosses has led since the 1980s. It explains his motivations for developing action semantics, the inspirations behind its design, and the foundations of action semantics based on unified algebras. It goes on to outline some applications of action semantics to describe real programming languages, and some efforts to implement programming languages using action semantics directed compiler generation. It concludes by outlining more recent developments and reflecting on the success of the action semantics project.

show abstract

“…Similarly, Braga and Mosses are using Maude to develop executable environment for Structural Operational Semantics and for Action Semantics [53]; and Bruni, Meseguer and Montanari have defined a mapping from Tile Logic to Rewriting Logic [9] and have used it as a basis for executing tile logic specifications in Maude [8]. It would be quite interesting to explore Maude implementations for other specification languages such as a next-generation CafeOBJ [26] and CASL [18].…”

Section: Implementing Formal Specification Languagesmentioning

confidence: 99%

Maude as a formal meta-tool

Clavel¹,

Durán

Eker

et al. 1999

FM’99 — Formal Methods

View full text Add to dashboard Cite

Abstract. Given the different perspectives from which a complex software system has to be analyzed, the multiplicity of formalisms is unavoidable. This poses two important technical challenges: how to rigorously meet the need to interrelate formalisms, and how to reduce the duplication of effort in tool and specification building across formalisms. These challenges could be answered by adequate formal meta-tools that, when given the specification of a formal inference system, generate an efficient inference engine, and when given a specification of two formalisms and a translation, generate an actual translator between them. Similarly, module composition operations that are logic-independent, but that at present require costly implementation efforts for each formalism, could be provided for logics in general by module algebra generator meta-tools. The foundations of meta-tools of this kind can be based on a metatheory of general logics. Their actual design and implementation can be based on appropriate logical frameworks having efficient implementations. This paper explains how the reflective logical framework of rewriting logic can be used, in conjunction with an efficient reflective implementation such as the Maude language, to design formal meta-tools such as those described above. The feasibility of these ideas and techniques has been demonstrated by a number of substantial experiments in which new formal tools and new translations between formalisms, efficient enough to be used in practice, have been generated.

show abstract

Action Semantics

Cited by 87 publications

References 0 publications

A Praxical Solution of the Symbol Grounding Problem

A Praxical Solution of the Symbol Grounding Problem

Action Semantics in Retrospect

Maude as a formal meta-tool

Contact Info

Product

Resources

About