Sciweavers

4498 search results - page 375 / 900
» How to Invent Functions
Sort
View
181
Voted
VL
1996
IEEE
105views Visual Languages» more  VL 1996»
15 years 11 months ago
Enhancing Iconic Program Reusability with Object Sharing
This paper describes how to improve the reusability of iconic program modules. In iconic programming systems, the most important features for reuse are the customization of a modu...
Yuichi Koike, Yasuyuki Maeda, Yoshiyuki Koseki
HICSS
1994
IEEE
152views Biometrics» more  HICSS 1994»
15 years 11 months ago
Simple COMA Node Implementations
Shared memory architectures often have caches to reduce the number of slow remote memory accesses. The largest possible caches exist in shared memory architectures called Cache-On...
Erik Hagersten, Ashley Saulsbury, Anders Landin
CHI
1994
ACM
15 years 11 months ago
Using aggregation and dynamic queries for exploring large data sets
When working with large data sets, users perform three primary types of activities: data manipulation, data analysis, and data visualization. The data manipulation process involve...
Jade Goldstein, Steven F. Roth
PLILP
1993
Springer
15 years 11 months ago
Higher-Order Chaotic Iteration Sequences
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
Mads Rosendahl
ERLANG
2007
ACM
15 years 10 months ago
A language for specifying type contracts in Erlang and its interaction with success typings
We propose a small extension of the ERLANG language that allows programmers to specify contracts with type information at the level of individual functions. Such contracts are opt...
Miguel Jimenez, Tobias Lindahl, Konstantinos F. Sa...