scispace - formally typeset
J

José F. Quesada

Researcher at University of Seville

Publications -  32
Citations -  1160

José F. Quesada is an academic researcher from University of Seville. The author has contributed to research in topics: Rewriting & Language technology. The author has an hindex of 8, co-authored 31 publications receiving 1127 citations. Previous affiliations of José F. Quesada include University of Granada.

Papers
More filters
Journal ArticleDOI

Maude: specification and programming in rewriting logic

TL;DR: The paper outlines the principles underlying the Maude system implementation, including its semicompilation techniques, and explains and illustrates with examples the main concepts of Maude's language design including its underlying logic, functional, system and object-oriented modules, as well as parameterized modules, theories, and views.
Book ChapterDOI

The Maude System

TL;DR: Maude is a high-performance language and system supporting both equational and rewriting logic computation for a wide range of applications, including development of theorem proving tools, language prototyping, executable specification and analysis of concurrent and distributed systems, and logical framework applications in which other logics are represented, translated, and executed.
Journal Article

The role of working memory on measuring mental models of physical systems

TL;DR: In this paper, the authors proposed that a mental model is a dynamic representation created in WM by combining information stored in LTM (the Conceptual Model of the system) and characteristics extracted from the environment.
Journal ArticleDOI

Towards Maude 2.0

TL;DR: Maude 2.0 as discussed by the authors is the latest version of the Maude rewriting logic language, which supports more expressiveness and more efficient support for a wider range of programming applications.
Journal ArticleDOI

Maude as a Metalanguage

TL;DR: This paper discusses the latest language design and implementation work on Maude as a reflective metalanguage in which entire environments---including syntax definition, parsing, pretty printing, execution, and input/output---can be defined for a language or logic £ of choice.