Sciweavers

6248 search results - page 338 / 1250
» Programming in a data factory
Sort
View
ICFP
2005
ACM
16 years 6 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
DRM
2007
Springer
16 years 28 days ago
Slicing obfuscations: design, correctness, and evaluation
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
Anirban Majumdar, Stephen Drape, Clark D. Thombors...
WWW
2004
ACM
16 years 7 months ago
XJ: integration of XML processing into java
The increased importance of XML as a universal data representation format has led to several proposals for enabling the development of applications that operate on XML data. These...
Igor Peshansky, Michael G. Burke, Mukund Raghavach...
200
Voted
SC
2003
ACM
16 years 4 hour ago
Dyn-MPI: Supporting MPI on Non Dedicated Clusters
Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participa...
D. Brent Weatherly, David K. Lowenthal, Mario Naka...
SAIG
2001
Springer
15 years 11 months ago
Short Cut Fusion: Proved and Improved
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...
Patricia Johann