Sciweavers

1280 search results - page 187 / 256
» Soft Typing with Conditional Types
Sort
View
DIS
1998
Springer
14 years 1 months ago
Uniform Characterizations of Polynomial-Query Learnabilities
We consider the exact learning in the query model. We deal with all types of queries introduced by Angluin: membership, equivalence, superset, subset, disjointness and exhaustivene...
Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara...
CHI
1996
ACM
14 years 1 months ago
LifeLines: Visualizing Personal Histories
LifeLines provide a general visualization environment for personal histories that can be applied to medical and court records, professional histories and other types of biographic...
Catherine Plaisant, Brett Milash, Anne Rose, Seth ...
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
14 years 1 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
IRREGULAR
1997
Springer
14 years 1 months ago
Programming with Shared Data Abstractions
ing with shared data abstractions Simon Dobson1 and Don Goodeve2 1 Well-Founded Systems Unit, CLRC Rutherford Appleton Laboratory, UK 2 School of Computer Studies, University of Le...
Simon A. Dobson, Don Goodeve
KR
1992
Springer
14 years 1 months ago
Reasoning About Indefinite Actions
In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permit...
L. Thorne McCarty, Ron van der Meyden