Formalizing homogeneous language embeddings

T. Clark; Laurence Tratt

doi:10.1016/j.entcs.2010.08.033

Formalizing homogeneous language embeddings

T. Clark, Laurence Tratt

Thames Valley University

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

Abstract

The cost of implementing syntactically distinct Domain Specific Languages (DSLs) can be reduced by homogeneously embedding them in a host language in cooperation with its compiler. Current homogeneous embedding approaches either restrict the embedding of multiple DSLs in order to provide safety guarantees, or allow multiple DSLs to be embedded but force the user to deal with the interoperability burden. In this paper we present the μ-calculus which allows parameterisable language embeddings to be specified and analysed. By reducing the problem to its core essentials we are able to show how multiple, expressive language embeddings can be defined in a homogeneous embedding context. We further show how variant calculi with safety guarantees can be defined.

Original language	English
Pages (from-to)	75-88
Number of pages	14
Journal	Electronic Notes in Theoretical Computer Science
Volume	253
Issue number	7
DOIs	https://doi.org/10.1016/j.entcs.2010.08.033
Publication status	Published - 17 Sept 2010

Access to Document

10.1016/j.entcs.2010.08.033

Cite this

@article{b299483ecb064f74862e043f782a456d,

title = "Formalizing homogeneous language embeddings",

abstract = "The cost of implementing syntactically distinct Domain Specific Languages (DSLs) can be reduced by homogeneously embedding them in a host language in cooperation with its compiler. Current homogeneous embedding approaches either restrict the embedding of multiple DSLs in order to provide safety guarantees, or allow multiple DSLs to be embedded but force the user to deal with the interoperability burden. In this paper we present the μ-calculus which allows parameterisable language embeddings to be specified and analysed. By reducing the problem to its core essentials we are able to show how multiple, expressive language embeddings can be defined in a homogeneous embedding context. We further show how variant calculi with safety guarantees can be defined.",

author = "T. Clark and Laurence Tratt",

year = "2010",

month = sep,

day = "17",

doi = "10.1016/j.entcs.2010.08.033",

language = "English",

volume = "253",

pages = "75--88",

journal = "Electronic Notes in Theoretical Computer Science",

issn = "1571-0661",

publisher = "Elsevier",

number = "7",

}

TY - JOUR

T1 - Formalizing homogeneous language embeddings

AU - Clark, T.

AU - Tratt, Laurence

PY - 2010/9/17

Y1 - 2010/9/17

N2 - The cost of implementing syntactically distinct Domain Specific Languages (DSLs) can be reduced by homogeneously embedding them in a host language in cooperation with its compiler. Current homogeneous embedding approaches either restrict the embedding of multiple DSLs in order to provide safety guarantees, or allow multiple DSLs to be embedded but force the user to deal with the interoperability burden. In this paper we present the μ-calculus which allows parameterisable language embeddings to be specified and analysed. By reducing the problem to its core essentials we are able to show how multiple, expressive language embeddings can be defined in a homogeneous embedding context. We further show how variant calculi with safety guarantees can be defined.

AB - The cost of implementing syntactically distinct Domain Specific Languages (DSLs) can be reduced by homogeneously embedding them in a host language in cooperation with its compiler. Current homogeneous embedding approaches either restrict the embedding of multiple DSLs in order to provide safety guarantees, or allow multiple DSLs to be embedded but force the user to deal with the interoperability burden. In this paper we present the μ-calculus which allows parameterisable language embeddings to be specified and analysed. By reducing the problem to its core essentials we are able to show how multiple, expressive language embeddings can be defined in a homogeneous embedding context. We further show how variant calculi with safety guarantees can be defined.

UR - http://www.scopus.com/inward/record.url?partnerID=yv4JPVwI&eid=2-s2.0-77956417771&md5=5dce72263b970b60209e3fa9ca24386e

U2 - 10.1016/j.entcs.2010.08.033

DO - 10.1016/j.entcs.2010.08.033

M3 - Article

AN - SCOPUS:77956417771

SN - 1571-0661

VL - 253

SP - 75

EP - 88

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

IS - 7

ER -

Formalizing homogeneous language embeddings

Abstract

Access to Document

Other files and links

Fingerprint

Cite this