hh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
An Idealized MetaML: Simpler, and More Expressive
University of Genoa, Genova, Italy.
Oregon Graduate Institute, Portland, OR, USA.ORCID iD: 0000-0003-3160-9188
Oregon Graduate Institute, Portland, OR, USA.
Oregon Graduate Institute, Portland, OR, USA.
1999 (English)In: Programming Languages and Systems: 8th European Symposium on Programming, ESOP'99, held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS'99, Amsterdam, The Netherlands, March 22-28, 1999 : proceedings / [ed] S. Doaitse Swierstra, Berlin: Springer Berlin/Heidelberg, 1999, p. 193-207Conference paper, Published paper (Refereed)
Abstract [en]

MetaML is a multi-stage functional programming language featuring three constructs that can be viewed as statically-typed refinements of the back-quote, comma, and eval of Scheme. Thus it provides special support for writing code generators and serves as a semanticallysound basis for systems involving multiple interdependent computational stages. In previous work, we reported on an implementation of MetaML, and on a reduction semantics and type-system for MetaML. In this paper, we present An Idealized MetaML (AIM) that is the result of our study of a categorical model for MetaML. An important outstanding problem is finding a type system that provides the user with a means for manipulating both open and closed code. This problem has eluded efforts by us and other researchers for over three years. AIM solves the issue by providing two type constructors, one classifies closed code and the other open code, and exploiting the way they interact. We point out that AIM can be verbose, and outline a possible remedy relating to the strictness of the closed code type. © Springer International Publishing AG, Part of Springer Science+Business Media 1999

Place, publisher, year, edition, pages
Berlin: Springer Berlin/Heidelberg, 1999. p. 193-207
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 1576
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:hh:diva-21095DOI: 10.1007/3-540-49099-X_13ISI: 000083613400013Libris ID: 5379903ISBN: 3-540-65699-5 OAI: oai:DiVA.org:hh-21095DiVA, id: diva2:588303
Conference
8th European Symposium on Programming, ESOP'99 held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS'99, Amsterdam, The Netherlands, March 22-28, 1999
Note

The research reported in this paper was supported by the USAF Air Materiel Command, contract #F19628-96-C-0161, NSF Grant IRI-9625462, DoD contract "Domain Specific Languages as a Carrier for Formal Methods", MURST progetto cofinanziato "Tecniche formali per la specica, l 'analisi, la verifica, la sintesi e la trasformazione di sistemi software", ESPRIT WG APPSEM

Available from: 2013-01-15 Created: 2013-01-15 Last updated: 2021-05-11Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records

Taha, Walid

Search in DiVA

By author/editor
Taha, Walid
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 147 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf