ACM Home Page
Please provide us with feedback. Feedback
Distributed meta-programming
Full text PdfPdf (187 KB)
Source Generative Programming And Component Engineering archive
Proceedings of the 5th international conference on Generative programming and component engineering table of contents
Portland, Oregon, USA
SESSION: Short papers table of contents
Pages: 243 - 248  
Year of Publication: 2006
ISBN:1-59593-237-2
Authors
Rui Shi  Boston University
Chiyan Chen  Yahoo! Inc.
Hongwei Xi  Boston University
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 31,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1173706.1173743
What is a DOI?

ABSTRACT

Distributed meta-programming (DMP), which allows code to be generated and distributed at run-time, has already become a common practice. However, code generation currently often relies on rather ad hoc approaches that represent code as plain text, making DMP notoriously error-prone. This unfortunate situation is further exacerbated due to issues such as mobility (of code) and locality and heterogeneity (of resources), which complicate testing and debugging drastically.In this paper, we study distributed meta-programming from a type-theoretic perspective, presenting a language to facilitate the construction of programs that may generate and distribute code at run-time. The approach we take makes use of a form of typeful code representation developed in a previous study on meta-programming, and it guarantees statically that only well-typed code (according to some chosen type discipline) can be constructed at run-time and sent to proper locations for execution. We also mention a prototype implementation in support of the practicality of our approach to DMP, providing a solid proof of concept.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
 
4
 
5
C. Chen, R. Shi, and H. Xi. Distributed meta-programming, 2004. Available at http://www.cs.bu.edu/~hwxi/academic/drafts/DMP.ps
6
 
7
 
8
N. G. de Bruijn. Lambda calculus notation with nameless dummies. Indagationes mathematicae, 34:381--392, 1972.
 
9
 
10
L. Jia and D. Walker. Modal proofs as distributed programs (extended abstract). In 13th European Symposium on Programming (ESOP'04), pages 219--233, Barcelona, Spain, March 2004. The full paper is available as technical report no. TR-671-03 of Computer Science Department, Princeton University.
 
11
 
12
 
13
J. Moody. Modal Logic as a Basis for Distributed Computation. Technical Report CMU-CS-03-194, Carnegie Mellon University, 2003.
 
14
 
15
A. Rossberg, J. Schwinghammer, G. Smolka, and G. Tack. Alice Programming Language. http://www.ps.uni-sb.de/alice/.
16
 
17
R. Shi and H. Xi. A Prototype Implementation of DMP in ATS, 2005. Available at: http://cs-people.bu.edu/shearer/research/projects/dmp/.
 
18
 
19
H. Xi. Applied Type System (extended abstract). In post-workshop Proceedings of TYPES 2003, pages 394--408. Springer-Verlag LNCS 3085, 2004.
 
20

Collaborative Colleagues:
Rui Shi: colleagues
Chiyan Chen: colleagues
Hongwei Xi: colleagues