An Equational Specification for the Scheme Language

dc.creatorAmorim,Marcelo
dc.creatorRosu,Grigore
dc.date2005
dc.date.accessioned2024-02-06T12:53:47Z
dc.date.available2024-02-06T12:53:47Z
dc.descriptionThis work describes the formal semantics of Scheme 3 as an equational theory in the Maude rewriting system. The semantics is based on continuations and is highly modular. We briefly investigate the relationship between our methodology for defining programming languages and other semantic formalisms. We conclude by showing some performance results of the interpreter obtained for free from the executable specification.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-011-07-1327
dc.identifierhttps://lib.jucs.org/article/28450/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/8814
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 11(7): 1327-1348
dc.subjectformal and executable semantics
dc.subjectequational specification
dc.subjectprogram analysis
dc.titleAn Equational Specification for the Scheme Language
dc.typeResearch Article
Файлы
Коллекции