Sciweavers

2853 search results - page 553 / 571
» On Coherence in Computer Algebra
Sort
View
SPAA
2004
ACM
15 years 3 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
WMPI
2004
ACM
15 years 3 months ago
The Opie compiler from row-major source to Morton-ordered matrices
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
Steven T. Gabriel, David S. Wise
90
Voted
IFIP
2004
Springer
15 years 3 months ago
New-HOPLA: A Higher-order Process Language with Name Generation
Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain ...
Glynn Winskel, Francesco Zappa Nardelli
MPC
2010
Springer
152views Mathematics» more  MPC 2010»
15 years 2 months ago
Lucy-n: a n-Synchronous Extension of Lustre
Synchronous functional languages such as Lustre or Lucid Synchrone define a restricted class of Kahn Process Networks which can be executed with no buffer. Every expression is as...
Louis Mandel, Florence Plateau, Marc Pouzet
TACS
1994
Springer
15 years 1 months ago
A Semantic Theory for Concurrent ML
In this paper we present a semantic theory for Concurrent ML. It consists of a new effect-based type system and a denotational model. The new type system is based on an extension o...
Dominique Bolignano, Mourad Debbabi