Sciweavers

1675 search results - page 125 / 335
» Some thoughts on teaching programming and programming langua...
Sort
View
APLAS
2009
ACM
15 years 11 months ago
On the Decidability of Subtyping with Bounded Existential Types
Bounded existential types are a powerful language feature ling partial data abstraction and information hiding. However, existentials do not mingle well with subtyping as found in ...
Stefan Wehr, Peter Thiemann
158
Voted
IPPS
2005
IEEE
15 years 10 months ago
Automatic Support for Irregular Computations in a High-Level Language
The problem of writing high performance parallel applications becomes even more challenging when irregular, sparse or adaptive methods are employed. In this paper we introduce com...
Jimmy Su, Katherine A. Yelick
POPL
2008
ACM
16 years 4 months ago
Automatic inference of stationary fields: a generalization of java's final fields
Java programmers can document that the relationship between two objects is unchanging by declaring the field that encodes that relationship to be final. This information can be us...
Christopher Unkel, Monica S. Lam
178
Voted
ACE
2003
180views Education» more  ACE 2003»
15 years 6 months ago
Managing the managers: Collaborative virtual teams with large staff and student numbers
Virtual teaming involving online presentations and peer reviews support the notion of collaborative student learning, whilst preparing them for the virtual work environment. Howev...
Kathy Egea
CORR
2004
Springer
151views Education» more  CORR 2004»
15 years 4 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...