Sciweavers

5096 search results - page 304 / 1020
» Associations as a Language Construct
Sort
View
ENTCS
2006
146views more  ENTCS 2006»
15 years 6 months ago
Strong Update, Disposal, and Encapsulation in Bunched Typing
We present a bunched intermediate language for strong (type-changing) update and disposal of first-order references. In contrast to other substructural type systems, the additive ...
Josh Berdine, Peter W. O'Hearn
ENTCS
2006
166views more  ENTCS 2006»
15 years 6 months ago
Arrows, like Monads, are Monoids
Monads are by now well-established as programming construct in functional languages. Recently, the notion of "Arrow" was introduced by Hughes as an extension, not with o...
Chris Heunen, Bart Jacobs
JFP
2000
95views more  JFP 2000»
15 years 6 months ago
A modular module system
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 detail...
Xavier Leroy
SCP
1998
163views more  SCP 1998»
15 years 6 months ago
Computing with Continuous Change
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
172
Voted
PPOPP
2003
ACM
16 years 8 hour ago
The design and implementation of a parallel array operator for the arbitrary remapping of data
Gather and scatter are data redistribution functions of longstanding importance to high performance computing. In this paper, we present a highly-general array operator with power...
Steven J. Deitz, Bradford L. Chamberlain, Sung-Eun...