Show simple item record

dc.creatorClavel, M.es
dc.creatorDurán, F.es
dc.creatorEker, S.es
dc.creatorLincoln, P.es
dc.creatorMartí Oliet, N.es
dc.creatorMeseguer, J.es
dc.creatorQuesada Moreno, José Franciscoes
dc.date.accessioned2019-06-12T09:57:34Z
dc.date.available2019-06-12T09:57:34Z
dc.date.issued2000
dc.identifier.citationClavel, M., Durán, F., Eker, S., Lincoln, P., Martí Oliet, N., Meseguer, J. y Quesada Moreno, J.F. (2000). Towards Maude 2.0. Electronic Notes in Theoretical Computer Science, 36 (2000), 294-315.
dc.identifier.issn1571-0661es
dc.identifier.urihttps://hdl.handle.net/11441/87370
dc.description.abstractMaude 2.0 is the new version of the Maude rewriting logic language currently under development. Maude 2.0’s three main goals are: (i) greater generality and expressiveness;( ii) efficient support for a wider range of programming applications;and (iii) usability as a key component for developing internet programming and mobile computing systems. To meet these goals, a number of new features have been added. The membership equational logic of functional modules and the rewriting logic of system modules are now supported in their greatest possible generality, and the operational semantics of object-oriented modules guarantees object and message fairness. Module operations in Full Maude are also more general thanks to parameterized theories and views. Efficient support for a wider range of programming applications is provided both by the Maude compiler—which can reach up to 15 million rewrites per second on a 667MHz Xeon—and by a library of new built-in modules. Besides new built-in functional modules, a key new feature is built-in object-oriented modules that provide flexible interaction with external objects such as file systems, window systems, and internet sockets. In particular, built-in internet sockets will provide excellent support for a new declarative style of internet programming in Maude, and will be used as a key building block to implement the Mobile Maude language.es
dc.formatapplication/pdfes
dc.language.isoenges
dc.publisherElsevieres
dc.relation.ispartofElectronic Notes in Theoretical Computer Science, 36 (2000), 294-315.
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.titleTowards Maude 2.0es
dc.typeinfo:eu-repo/semantics/articlees
dc.type.versioninfo:eu-repo/semantics/submittedVersiones
dc.rights.accessrightsinfo:eu-repo/semantics/openAccesses
dc.contributor.affiliationUniversidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificiales
dc.relation.publisherversionhttps://www.sciencedirect.com/science/article/pii/S1571066105801379es
dc.identifier.doi10.1016/S1571-0661(05)80137-9es
idus.format.extent22es
dc.journaltitleElectronic Notes in Theoretical Computer Sciencees
dc.publication.volumen36es
dc.publication.issue2000es
dc.publication.initialPage294es
dc.publication.endPage315es
dc.identifier.sisius6531758es

FilesSizeFormatViewDescription
Towards Maude 2.0.pdf209.4KbIcon   [PDF] View/Open  

This item appears in the following collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Except where otherwise noted, this item's license is described as: Attribution-NonCommercial-NoDerivatives 4.0 Internacional