ACM Home Page
Please provide us with feedback. Feedback
User-friendly functional programming for web mashups
Full text PdfPdf (724 KB)
Source
International Conference on Functional Programming archive
Proceedings of the 12th ACM SIGPLAN international conference on Functional programming table of contents
Freiburg, Germany
SESSION: Mainstream problems table of contents
Pages: 223 - 234  
Year of Publication: 2007
ISBN:978-1-59593-815-2
Also published in ...
Authors
Rob Ennals  Intel Research, Berkeley, CA
David Gay  Intel Research, Berkeley, CA
Sponsors
ACM: Association for Computing Machinery
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 10
Additional Information:

abstract   references   cited by   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/1291151.1291187
What is a DOI?

ABSTRACT

MashMaker is a web-based tool that makes it easy for a normal user to create web mashups by browsing around, without needing to type, or plan in advance what they want to do.

Like a web browser, Mashmaker allows users to create mashups by browsing, rather than writing code, and allows users to bookmark interesting things they find, forming new widgets - reusable mashup fragments. Like a spreadsheet, MashMaker mixes program and data and allows ad-hoc unstructured editing of programs.

MashMaker is also a modern functional programming language with non-side effecting expressions, higher order functions, and lazy evaluation. MashMaker programs can be manipulated either textually, or through an interactive tree representation, in which a program is presented together with the values it produces.

In order to cope with this unusual domain, MashMaker contains a number of deviations from normal function languages. The most notable of these is that, in order to allow the programmer to write programs directly on their data, all data is stored in a single tree, and evaluation of an expression always takes place at a specific point in this tree, which also functions as its scope.


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
6
7
8
9
10
 
11
Thomas Leonard. Tree-Sheets and Structured Documents. PhD thesis, University of Southampton, 2004.
 
12
Henry Lieberman. Your wish is my command: programming by example. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2001. ISBN 1-55860-688-2.
13
14
15
 
16
Simon Peyton Jones. Wearing the hair shirt: a retrospective on Haskell (invited talk). In ACM SIGPLAN Conferenge on Principles of Programming Languages (POPL'03), 2003.
 
17
Simon Peyton Jones, editor. Haskell 98 Language and Libraries: the Revised Report. Cambridge University Press, May 2003.
18
19
20
 
21
22
 
23
Masato Takeichi, Zhenjiang Hu, Kazuhiko Kakehi, Yashushi Hayashi, Shin-Cheng Mu, and Keisuke Nakano. TreeCalc: towards programmable structured documents. In Japan Society for Software Science and Technology, 2003.
24

CITED BY  10