Thu, 21 Aug 2008 14:10:08 BST CiteULike: twleung's library [110 articles] http://www.citeulike.org/user/twleung CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/twleung/article/74202 <i>(2002)</i><br /><br />We propose a new extension to the purely functional programming language Haskell that supports compile-time meta-programming. The purpose of the system is to support the algorithmic construction of programs at compile-time. Template meta-programming for haskell T Sheard S Jones (2002) 2005-01-09T22:37:08-00:00 2002 metaprogramming http://www.citeulike.org/user/twleung/article/4299 <i>(2003)</i><br /><br />The BitTorrent file distribution system uses tit-for-tat as a method of seeking pareto efficiency. It achieves a higher level of robustness and resource utilization than any currently known cooperative technique. We explain what BitTorrent does, and how economic methods are used to achieve that goal. Incentives Build Robustness in BitTorrent Bram Cohen (2003) 2004-12-20T08:32:02-00:00 2003 bittorrent p2p http://www.citeulike.org/user/twleung/article/71746 <i>(2004)</i><br /><br />P2P systems for sharing content have become very popular over the last few years. However, despite the increasing attention of both the research community and large numbers of users, the actual behavior of these systems over prolonged periods of time is still poorly understood. This paper presents a detailed measurement study over a period of eight months of BitTorrent/Suprnova, a P2P file-sharing system that is quickly gaining in popularity. In particular, we show measurement results of... A measurement study of the bittorrent peer-to-peer file-sharing system J Pouwelse P Garbacki D Epema H Sips (2004) 2005-01-02T15:05:20-00:00 2004 bittorrent p2p http://www.citeulike.org/user/twleung/article/71755 <i>SIGPLAN Notices, Vol. 35, No. 6. (2000), pp. 26-36.</i><br /><br />We survey the literature available on the topic of domain-specific languages as used for the construction and maintenance of software systems. We list a selection of 75 key publications in the area, and provide a summary for each of the papers. Moreover, we discuss terminology, risks and benefits, example domain-specific languages, design methodologies, and implementation techniques. 1 Introduction In all branches of science and engineering one can distinguish between approaches that are... Domain-Specific Languages: An Annotated Bibliography Arie van Deursen Paul Klint Joost Visser SIGPLAN Notices, Vol. 35, No. 6. (2000), pp. 26-36. 2005-01-02T18:33:11-00:00 2000 SIGPLAN Notices 35 6 26 36 dsl http://www.citeulike.org/user/twleung/article/4850 <i>(2001)</i><br /><br />Dependent types reflect the fact that validity of data is often a relative notion by allowing prior data to affect the types of subsequent data. Not only does this make for a precise type system, but also a highly generic one: both the type and the program for each instance of a family of operations can be computed from the data which codes for that instance. Recent experimental extensions to the Haskell type class mechanism give us strong tools to relativize types to other types. We may... Faking it---simulating dependent types in Haskell C Mcbride (2001) 2004-12-23T15:01:56-00:00 2001 dependent-types types http://www.citeulike.org/user/twleung/article/70684 <i>(2000)</i><br /><br />In a recent paper, Launchbury, Lewis, and Cook observe that some Haskell applications could benefit from a combinator mfix for expressing recursion over monadic types. We investigate three possible definitions of mfix and implement them in Haskell. Like traditional fixpoint operators, there are two approaches to the definition of mfix: an unfolding one based on mathematical semantics, and an updating one based on operational semantics. The two definitions are equivalent in pure calculi... Recursion is a computational effect D Friedman A Sabry (2000) 2004-12-28T21:29:25-00:00 2000 effects monads http://www.citeulike.org/user/twleung/article/72259 <i></i><br /><br />interpretation was the operative model in both the ambitious Tenenbaum-based [196] type inferencer and Paige's more general RAPTS [158] transformational system (the predecessor to APTS), which was used to prototype "meta-SETL" [4], an AST-traversing interpreter. SED employed a rich set of language processing tools such as Typol [51, 52] for type checking and other semantic analysis via pattern-directed inference (abstract interpretation), and a Mentor-based [74] interface to the syntax-directed ... SETL fot Internet Data Processing David Bacon 2005-01-05T15:24:26-00:00 setl http://www.citeulike.org/user/twleung/article/72193 <i></i><br /><br />OF DISSERTATION Submitted in partial ful llment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate School of Computer Science Northeastern University, June 2003 A.D. Web Interactions Paul Graunke 2005-01-05T04:19:17-00:00 continuations http://www.citeulike.org/user/twleung/article/3305 <i>No. RT-0117. (February 1990)</i><br /><br />This report details the design and implementation of the ZINC system. This is an implementation of the ML language, intended to serve as a test field for various extensions of the language, and for new implementation techniques as well. This system is strongly oriented toward separate compilation and the production of small, standalone programs The ZINC experiment : an economical implementation of the ML language Xavier Leroy No. RT-0117. (February 1990) 2004-12-10T23:45:41-00:00 1990 RT-0117 compilers ml http://www.citeulike.org/user/twleung/article/71839 <i>(1993), pp. 32-46.</i><br /><br />Standard ML is one of a number of new programming languages developed in the 1980s that are seen as suitable vehicles for serious systems and applications programming. It offers an excellent ratio of expressiveness to language complexity, and provides competitive efficiency. Because of its type and module system, Standard ML manages to combine safety, security, and robustness with much of the flexibility of dynamically typed languages like Lisp. It is also has the most well-developed scientific ... Reflections on Standard ML David Macqueen (1993), pp. 32-46. 2005-01-04T00:55:54-00:00 1993 32 46 ml http://www.citeulike.org/user/twleung/article/71835 <i></i><br /><br />Object identity combines the distinct notions of reference and comparison. Both notions impose restrictions on the identity concept, resulting in it meeting some lowest common denominator of requirements and limiting its expressive power. By clearly separating the two notions, we can find solutions for yet unresolved problems, for example the problems concerning object identity in the well-known Decorator Pattern. Separation of Object Identity Concerns Pascal Costanza 2005-01-03T22:09:42-00:00 aop http://www.citeulike.org/user/twleung/article/71832 <i></i><br /><br />Object-oriented systems rely on classification of objects as a basic principle. This classification can depend on the type of the object, or its state. Many systems, including almost all object-oriented programming languages, only support classification by type, making classes independent of state changes. Many application domains, however, use taxonomies based on classification by state. Views in database systems can achieve this kind of classification but object-oriented database systems do... Typesafe Dynamic Classification Jürgen Schlegelmilch 2005-01-03T19:24:15-00:00 types http://www.citeulike.org/user/twleung/article/71834 <i>Vol. 1445 (1998), pp. 186-211.</i><br /><br />Predicate dispatching generalizes previous method dispatch mechanisms by permitting arbitrary predicates to control method applicability and by using logical implication between predicates as the overriding relationship. The method selected to handle a message send can depend not just on the classes of the arguments, as in ordinary object-oriented dispatch, but also on the classes of subcomponents, on an argument's state, and on relationships between objects. This simple mechanism... Predicate Dispatching: A Unified Theory of Dispatch Michael Ernst Crag Kaplan Craig Chambers Vol. 1445 (1998), pp. 186-211. 2005-01-03T22:01:47-00:00 1998 1445 186 211 Springer-Verlag multimethods predicate-dispatch http://www.citeulike.org/user/twleung/article/72151 <i>(2001)</i> Working for Free? - Motivations of Participating in Open Source Projects A Hars S Ou (2001) 2005-01-04T16:14:14-00:00 2001 IEEE Computer Society opensource http://www.citeulike.org/user/twleung/article/71841 <i>(1998)</i><br /><br />een integers numbers and floating-point numbers at compile-time. The main motivation for this separation, according to Fortran's designers, was to avoid the difficulties of handling mixed arithmetic at run-time [2, chapter 6]. Thanks to the type system, the compiler "knows" when to generate integer arithmetic operations, floating-point arithmetic operations, and conversions between integers and floats. ? This text is published as the introduction to the proceedings of the 1998 Types in... An overview of Types in Compilation X Leroy (1998) 2005-01-04T01:01:02-00:00 1998 compilers types http://www.citeulike.org/user/twleung/article/71842 <i>(FebruaryJanuary--FebruaryApril 1996), pp. 295-308.</i><br /><br />Some applications are most easily expressed in a programming language that supports concurrency, notably interactive and distributed systems. We propose extensions to the purely-functional language Haskell that allows it to express explicitly concurrent applications; we call the resulting language Concurrent Haskell. The resulting system appears to be both expressive and efficient, and we give a number of examples of useful abstractions that can be built from our primitives. We have developed a ... Concurrent Haskell Simon Jones Andrew Gordon Sigbjorn Finne (FebruaryJanuary--FebruaryApril 1996), pp. 295-308. 2005-01-04T01:13:56-00:00 1996 295 308 concurrency http://www.citeulike.org/user/twleung/article/71749 <i>(# 2000)</i><br /><br />Long a matter of folklore, the "small-world phenomenon" -- the principle that we are all linked by short chains of acquaintances -- was inaugurated as an area of experimental study in the social sciences through the pioneering work of Stanley Milgram in the 1960's. This work was among the first to make the phenomenon quantitative, allowing people to speak of the "six degrees of separation" between any two people in the United States. Since then, a number of network models have been proposed as... The Small-World Phenomenon: An Algorithmic Perspective Jon Kleinberg (# 2000) 2005-01-02T16:34:15-00:00 networks http://www.citeulike.org/user/twleung/article/4916 <i>(1996), pp. 42-53.</i><br /><br />We demonstrate the pragmatic value of the principal typing property, a property distinct from ML's principal type property, by studying a type system with principal typings. The type system is based on rank 2 intersection types and is closely related to ML. Its principal typing property provides elegant support for separate compilation, including "smartest recompilation" and incremental type inference, and for accurate type error messages. Moreover, it motivates a new rule for typing recursive... What are principal typings and what are they good for? Trevor Jim (1996), pp. 42-53. 2004-12-24T02:59:55-00:00 1996 42 53 types http://www.citeulike.org/user/twleung/article/71784 <i></i><br /><br />Most of the functional parsers published today focus on elegance. But they pay for this elegance by neglecting practical requirements such as eciency and decent error handling. By contrast, a traditional parser (generator) based on LL- or LR-principles focuses on eciency and neglects issues such as elegance and understandability almost entirely. In this paper we combine these pragmatic issues with the desire for elegance, using techniques from the realms of functional programming and... How To Obtain Powerful Parsers That Are Elegant and Practical P Pepper 2005-01-02T19:22:28-00:00 compilers http://www.citeulike.org/user/twleung/article/71779 <i>(1996), pp. 54-67.</i><br /><br />We study an extension of the Hindley#Milner system with explicit type scheme annotations and type declarations. The system can express polymorphic function arguments, user-de#ned data types with abstract components, and structure types with polymorphic #elds. More generally, all programs of the polymorphic lambda calculus can be encoded by a translation between typing derivations. We show that type reconstruction in this system can be reduced to the decidable problem of #rst-order uni#cation... Putting Type Annotations to Work Martin Odersky Konstantin Läufer (1996), pp. 54-67. 2005-01-02T19:05:40-00:00 1996 54 67 types http://www.citeulike.org/user/twleung/article/1337 <i>J. ACM, Vol. 27, No. 1. (January 1980), pp. 164-180.</i> Continuation-Based Program Transformation Strategies Mitchell Wand doi:10.1145/322169.322183 J. ACM, Vol. 27, No. 1. (January 1980), pp. 164-180. 2004-12-01T22:32:41-00:00 1980 J. ACM 0004-5411 27 1 164 180 ACM Press continuations http://www.citeulike.org/user/twleung/article/1359 <i>Higher Order Symbol. Comput., Vol. 12, No. 1. (April 1999), pp. 7-45.</i> Implementation Strategies for First-Class Continuations William Clinger Anne Hartheimer Eric Ost doi:10.1023/A:1010016816429 Higher Order Symbol. Comput., Vol. 12, No. 1. (April 1999), pp. 7-45. 2004-12-01T23:05:43-00:00 1999 Higher Order Symbol. Comput. 1388-3690 12 1 7 45 Kluwer Academic Publishers continuations http://www.citeulike.org/user/twleung/article/1333 <i>(1990), pp. 161-175.</i> Reasoning with continuations II: full abstraction for models of control Dorai Sitaram Matthias Felleisen doi:10.1145/91556.91626 (1990), pp. 161-175. 2004-12-01T22:32:29-00:00 1990 161 175 ACM Press continuations http://www.citeulike.org/user/twleung/article/4838 <i>(1994), pp. 446-457.</i> Representing monads Andrzej Filinski doi:10.1145/174675.178047 (1994), pp. 446-457. 2004-12-23T14:20:03-00:00 1994 446 457 ACM Press continuations effects monads http://www.citeulike.org/user/twleung/article/1335 <i>(1991), pp. 185-196.</i> Models of continuations without continuations Dorai Sitaram Matthias Felleisen doi:10.1145/99583.99611 (1991), pp. 185-196. 2004-12-01T22:32:40-00:00 1991 185 196 ACM Press continuations http://www.citeulike.org/user/twleung/article/71766 <i>(1996)</i><br /><br />Syntax Notation One (ASN.1), Recommendation X.208, Geneva, Switzerland. [13] CCITT Specification of Basic Encoding Rules (BER for Abstract Syntax One (ASN.1), Recommendation X.209, Geneva, Switzerland. [14] Gray, Jim and Reuter, Andreas Transaction Processing Concepts and Techniques, Morgan Kaufmann Publishers, 1993. 144 Bibliography ... Concurrent Programming in Erlang, Second Edition Joe Armstrong Robert Virding Claes Wikström Mike Williams (1996) 2005-01-02T18:43:40-00:00 1996 Prentice-Hall erlang http://www.citeulike.org/user/twleung/article/71767 <i></i><br /><br />The growing field of Design Patterns offers hope of controlling the complexities associated with the development of large software applications. The architecture of a system can be expressed at a higher level of abstraction, which allows the designer to concentrate on the specifics of the application rather than having to deal with low-level issues. Simulations are today an essential tool for research and training in areas such as national defense, where simulations are a cheaper (and sometimes ... Design Patterns for Simulations in Erlang/OTP Ulf Ekström 2005-01-02T18:47:01-00:00 erlang patterns http://www.citeulike.org/user/twleung/article/71768 <i>(1997), pp. 196-203.</i><br /><br />This paper describes the development of the programming language Erlang during the period 1985-1997. Erlang is a concurrent programming language designed for programming large-scale distributed soft real-time control applications. The design of Erlang was heavily influenced by ideas from the logic and functional programming communities. Other sources of inspiration came from languages such as Chill and Ada which are used in industry for programming control systems. 1 Introduction This paper... The Development of Erlang Joe Armstrong (1997), pp. 196-203. 2005-01-02T18:48:22-00:00 1997 196 203 erlang http://www.citeulike.org/user/twleung/article/71769 <i>(1995)</i><br /><br />The "software crisis" is yet to be solved. The problem is that software development and maintenance is too time consuming and thereby too expensive. One way to try to solve or partly solve the problem is to employ new programming languages with properties that reduce development time and help in maintenance. Erlang, a language developed by an Ericsson company, may be such a language. The topic of this report is whether Erlang is a better platform for developing a specific telecom application, a ... A Comparison Between Erlang and C++ for Implementation of Telecom Applications T Et J Grafstrom (1995) 2005-01-02T18:48:52-00:00 1995 erlang http://www.citeulike.org/user/twleung/article/71770 <i>(1994)</i><br /><br />: The construction of computer systems consisting of more than one computer is becoming more common. The complexity of such systems is higher than single computer systems. This paper addresses the question of how to simplify the construction of large concurrent distributed systems. To do this we have augmented the functional concurrent programming language Erlang with constructs for distributed programming. Distributed programs written in Erlang typically combine techniques for symbolic... Distributed Programming in Erlang C Wikstrom (1994) 2005-01-02T18:50:00-00:00 1994 erlang http://www.citeulike.org/user/twleung/article/71773 <i>(2002)</i><br /><br />this report, besides the memory model of Erlang/OTP,two additional memory architectures will be explored. The aim is to improveoverall performance by minimizing the time spent in message passing. To reduce communication overhead something else will have to be paid, and in this case the garbage collector will take the load Exploring alternative memory architectures for Erlang: Implementation and performance evaluation J Wilhelmsson (2002) 2005-01-02T18:52:00-00:00 2002 erlang http://www.citeulike.org/user/twleung/article/71775 <i>(2002)</i><br /><br />The concurrent functional programming language Erlang has been designed to ease the development of large-scale distributed soft real-time control applications. So far, it has been used quite successfully in industry, both within Ericsson Telecom, where it was designed and developed, and by other companies. This "declarative language success-story" has taken place despite the fact that Erlang implementations are slow compared with implementations of other functional languages. Wanting to improve ... The development of the HiPE system: Design and experience report E Johansson M Pettersson K Sagonas T Lindgren (2002) 2005-01-02T18:52:37-00:00 2002 erlang http://www.citeulike.org/user/twleung/article/71776 <i></i><br /><br />We present a user-oriented description of features and characteristics of the High Performance Erlang (HiPE) native code compiler, which nowadays is part of Erlang/OTP. In particular, we describe components and recent additions to the compiler that improve its performance and extend its functionality. In addition, we attempt to give some recommendations on how users can get the best out of HiPE's performance. All you wanted to know about the HiPE compiler But Have 2005-01-02T18:52:55-00:00 erlang http://www.citeulike.org/user/twleung/article/71777 <i></i><br /><br />Erlang is a concurrent functional language, tailored for large-scale distributed and fault-tolerant control software. Its primary implementation is Ericsson 's Erlang/OTP system, which is based on a virtual machine interpreter. The HiPE/x86 Erlang Compiler: System Description And Evaluation 2005-01-02T18:53:07-00:00 erlang http://www.citeulike.org/user/twleung/article/71778 <i></i><br /><br />The report will show how process-oriented discrete event simulation can be performed in the programming language Erlang. A small introduction to simulation and Erlang is given. The model used for discrete event simulation in Erlang and mechanisms for interaction in-between simulation processes are described. The author also illustrates how an extension to distributed simulation can be made. Descriptive examples and larger applications are presented. In the last passage of the report function... Discrete Event Simulation in Erlang Andreas Ermedahl 2005-01-02T18:59:34-00:00 erlang http://www.citeulike.org/user/twleung/article/3422 <i>(2004), pp. 41-42.</i> Implementing DSLs in metaOCaml Miguel Guerrero Edward Pizzi Robert Rosenbaum Kedar Swadi Walid Taha doi:10.1145/1028664.1028687 (2004), pp. 41-42. 2004-12-12T04:15:44-00:00 2004 41 42 ACM Press dsl metaocaml staging http://www.citeulike.org/user/twleung/article/71781 <i>Vol. 34, No. 1. (January 1998), pp. 261-272.</i> Imperative streams&mdash;a monadic combinator library for synchronous programming Enno Scholz doi:10.1145/289423.289454 Vol. 34, No. 1. (January 1998), pp. 261-272. 2005-01-02T19:19:49-00:00 1998 34 1 261 272 ACM Press monads http://www.citeulike.org/user/twleung/article/71783 <i>No. NOTTCS-TR-96-4. (1996)</i><br /><br />In functional programming, a popular approach to building recursive descent parsers is to model parsers as functions, and to define higher-order functions (or combinators) that implement grammar constructions such as sequencing, choice, and repetition. Such parsers form an instance of a monad , an algebraic structure from mathematics that has proved useful for addressing a number of computational problems. The purpose of this article is to provide a step-by-step tutorial on the monadic approach ... Monadic Parser Combinators Graham Hutton Erik Meijer No. NOTTCS-TR-96-4. (1996) 2005-01-02T19:21:36-00:00 1996 NOTTCS-TR-96-4 monads http://www.citeulike.org/user/twleung/article/71754 <i></i><br /><br />cted from embedded implementations in a semi automated way, further blending the distinction between the two approaches. This bodes well for lessening the cost of deploying a DSL since its suggests several strategies for evolving an embedded implementation to a stand-alone one in a cost e#ective way. The proposed research would investigate applying meta-programming tools to DSL evolution, in several di#erent dimensions: . Extending the capabilities of host languages for embedded... Evolving Domain Specific Languages Project We 2005-01-02T18:32:49-00:00 dsl http://www.citeulike.org/user/twleung/article/4851 <i>(1999), pp. 109-122.</i><br /><br />Domain-specific embedded languages (DSELs) expressed in higher-order, typed (HOT) languages provide a composable framework for domain-specific abstractions. Such a framework is of greater utility than a collection of stand-alone domain-specific languages. Usually, embedded domain specific languages are build on top of a set of domain specific primitive functions that are ultimately implemented using some form of foreign function call. We sketch a general design pattern for embedding... Domain specific embedded compilers Daan Leijen Erik Meijer (1999), pp. 109-122. 2004-12-23T15:07:08-00:00 1999 109 122 dsl staging http://www.citeulike.org/user/twleung/article/71782 <i>(2001)</i><br /><br />This article describes a novel approach to compiler generation, based on monadic combinators. A prototype of a compiler generator, called M'imico, is described, that handles infinite look-ahead and left recursive context free grammars, and dyadic infix operator precedence and associativity. Novel ideas and the general principle from which this work has been based are presented, as well as limitations of M'imico and a comparison with related work. 1 A monadic combinator compiler compiler C Camarao L Figueiredo (2001) 2005-01-02T19:20:56-00:00 2001 monads http://www.citeulike.org/user/twleung/article/71764 <i>J. Syst. Softw., Vol. 56, No. 1. (February 2001), pp. 91-99.</i> Notable design patterns for domain-specific languages Diomidis Spinellis doi:10.1016/S0164-1212(00)00089-3 J. Syst. Softw., Vol. 56, No. 1. (February 2001), pp. 91-99. 2005-01-02T18:39:55-00:00 2001 J. Syst. Softw. 0164-1212 56 1 91 99 Elsevier Science Inc. dsl patterns http://www.citeulike.org/user/twleung/article/71763 <i>(1999), pp. 81-94.</i><br /><br />The impact of Domain Specific Languages (DSLs) on software design is considerable. They allow programs to be more concise than equivalent programs written in a high-level programming languages. They relieve programmers from making decisions about data-structure and algorithm design, and thus allows solutions to be constructed quickly. Because DSL's are at a higher level of abstraction they are easier to maintain and reason about than equivalent programs written in a highlevel language, and... DSL implementation using staging and monads Tim Sheard Zine-El-Abidine Benaissa Emir Pasalic (1999), pp. 81-94. 2005-01-02T18:38:53-00:00 1999 81 94 dsl monads staging http://www.citeulike.org/user/twleung/article/71762 <i>(2000), pp. 9-27.</i><br /><br />Functional languages are particularly well-suited to the implementation of interpreters for domain-specific embedded languages (DSELs). We describe an implemented technique for producing optimizing compilers for DSELs, based on Kamin's idea of DSELs for program generation. The technique uses a data type of syntax for basic types, a set of smart constructors that perform rewriting over those types, some code motion transformations, and a back-end code generator. Domain-specific optimization... Compiling Embedded Languages Conal Elliott Sigbjorn Finne Oege de Moor (2000), pp. 9-27. 2005-01-02T18:37:43-00:00 2000 9 27 dsl http://www.citeulike.org/user/twleung/article/71756 <i></i><br /><br />Inspired by the successes of program generation, partial evaluation, and runtime code generation, multi-stage languages were developed as a uniform, high-level, and principled view of staging. Our current goal is to demonstrate the utility of these languages in a practical implementation. As a rst step this paper presents MetaOCaml, a type-safe, multi-stage language, built as an extension to OCaml's bytecode compiler. Future-stage computations are represented as source programs. This makes it... A Bytecode-Compiled, Type-safe, Multi-Stage Language Cristiano Calcagno Walid Taha Liwen Huang Xavier Leroy 2005-01-02T18:35:00-00:00 metaocaml metaprogramming staging http://www.citeulike.org/user/twleung/article/71753 <i></i><br /><br />We define a domain specific embedded language in Haskell to describe layered software architectures of editors. By using a typed programming language to describe the architecture, the type correctness of its components is guaranteed by the type checker of the language. Furthermore, because the architecture description of a system is part of the implementation of the system, the implementation will always comply with the architecture. Combinators for Layered Software Architectures Martijn Schrage Johan Jeuring Doaitse Swierstra 2005-01-02T18:30:45-00:00 dsl http://www.citeulike.org/user/twleung/article/71801 <i>Journal of Functional Programming, Vol. 10, No. 3. (2000), pp. 269-303.</i><br /><br />A simple implementation of an SML-like module system is presented as a module parameterized by a base language and its type-checker. This implementation is useful both as a detailed tutorial on the Harper-Lillibridge-Leroy module system and its implementation, and as a constructive demonstration of the applicability of that module system to a wide range of programming languages. A modular module system Xavier Leroy Journal of Functional Programming, Vol. 10, No. 3. (2000), pp. 269-303. 2005-01-03T03:53:14-00:00 2000 Journal of Functional Programming 10 3 269 303 modules http://www.citeulike.org/user/twleung/article/3228 <i>(1988), pp. 96-105.</i> Concrete syntax for data objects in functional languages Annika Aasa Kent Petersson Dan Synek doi:10.1145/62678.62688 (1988), pp. 96-105. 2004-12-09T19:33:19-00:00 1988 96 105 ACM Press dsl http://www.citeulike.org/user/twleung/article/3202 <i>(1989), pp. 281-292.</i><br /><br />Using concepts from denotational semantics, we have produced a very simple compiler that can be used to compile standard programming languages and produces object code as efficient as that of production compilers. The compiler is based entirely on source-to-source transformations performed on programs that have been translated into an intermediate language resembling the lambda calculus. The output of the compiler, while still in the intermediate language, can be trivially translated into... Realistic Compilation by Program Transformation Richard Kelsey Paul Hudak (1989), pp. 281-292. 2004-12-09T17:42:48-00:00 1989 281 292 compilers http://www.citeulike.org/user/twleung/article/71466 <i>(2002)</i><br /><br />Recent work on querying data streams has focused on systems where newly arriving data is processed and continuously streamed to the user in real-time. In many emerging applications, however, ad hoc queries and/or intermittent connectivity also require the processing of data that arrives prior to query submission or during a period of disconnection. For such applications, we have developed PSoup, a system that combines the processing of ad-hoc and continuous queries by treating data... Streaming Queries over Streaming Data S Chandrasekaran M Franklin (2002) 2004-12-30T22:17:29-00:00 2002 dsms