Sciweavers

10871 search results - page 459 / 2175
» A stable programming language
Sort
View
176
Voted
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 11 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
PLANX
2008
15 years 8 months ago
XML Stream Processing Using a Lazy Concurrent Language
Motivated by previous work on XML stream processing, we noticed that programmers need concurrency to save space, especially in a lazy language. User-controllable concurrency provi...
Shin-Cheng Mu, Ta-Chung Tsai, Keisuke Nakano
202
Voted
AOSD
2010
ACM
15 years 7 months ago
An architecture for composing embedded domain-specific languages
Embedded domain-specific languages (EDSLs) are said to be easier to compose than DSLs that are implemented by preprocessors. However, existing approaches focus on composition scen...
Tom Dinkelaker, Michael Eichberg, Mira Mezini
TGC
2005
Springer
16 years 10 days ago
A Distributed Object-Oriented Language with Session Types
Abstract. In the age of the world-wide web and mobile computing, programming communication-centric software is essential. Thus, programmers and program designers are exposed to new...
Mariangiola Dezani-Ciancaglini, Nobuko Yoshida, Al...
159
Voted
ECOOP
2006
Springer
15 years 10 months ago
Session Types for Object-Oriented Languages
A session takes place between two parties; after establishing a connection, each party interleaves local computations and communications (sending or receiving) with the other. Ses...
Mariangiola Dezani-Ciancaglini, Dimitris Mostrous,...