Sciweavers

13271 search results - page 191 / 2655
» Computers, Programming, and People
Sort
View
181
Voted
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 8 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
MSCS
2008
86views more  MSCS 2008»
15 years 4 months ago
Maurer computers for pipelined instruction processing
We model micro-architectures with non-pipelined instruction processing and pipelined instruction processing, using Maurer machines, basic thread algebra and program algebra. We sho...
Jan A. Bergstra, C. A. Middelburg
CACM
1999
49views more  CACM 1999»
15 years 4 months ago
OO Distributed Programming is Not Distributed OO Programming
centralized abstractions. The metaphor of a community of independent objects communicating by passing messages is misleading and dangerous when thinking in terms of a distributed s...
Rachid Guerraoui, Mohamed Fayad
ICCL
1998
IEEE
15 years 8 months ago
Loop Optimization for Aggregate Array Computations
An aggregate array computation is a loop that computes accumulated quantities over array elements. Such computations are common in programs that use arrays, and the array elements...
Yanhong A. Liu, Scott D. Stoller
SAIG
2001
Springer
15 years 9 months ago
MetaKlaim: Meta-programming for Global Computing
Most foundational models for global computing have focused on the spatial dimension of computations, however global computing requires also new ways of thinking about the temporal ...
Gian Luigi Ferrari, Eugenio Moggi, Rosario Puglies...