Sciweavers

13734 search results - page 32 / 2747
» Abstractions of data types
Sort
View
POPL
1998
ACM
14 years 29 days ago
A Functional Representation of Data Structures with a Hole
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...
Yasuhiko Minamide
FUIN
2010
103views more  FUIN 2010»
13 years 6 months ago
Automation for Dependently Typed Functional Programming
Abstract. Writing dependently typed functional programs that capture non-trivial program properties, such as those involving membership, ordering and non-linear arithmetic, is diff...
Sean Wilson, Jacques D. Fleuriot, Alan Smaill
EUC
2005
Springer
14 years 2 months ago
Human Position/Height Detection Using Analog Type Pyroelectric Sensors
Abstract. Pyroelectric sensors can detect changes of infrared rays. Usually, typical pyroelectric sensors are the digital output type, used for lighting switches and security syste...
Shinya Okuda, Shigeo Kaneda, Hirohide Haga
ICDT
1997
ACM
95views Database» more  ICDT 1997»
14 years 27 days ago
Type-Consistency Problems for Queries in Object-Oriented Databases
Abstract Method invocation mechanism is one of the essential features in objectoriented programming languages. This mechanism contributes to data encapsulation and code reuse, but ...
Yasunori Ishihara, Hiroyuki Seki, Minoru Ito
POPL
1993
ACM
14 years 25 days ago
Graph Types
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
Nils Klarlund, Michael I. Schwartzbach