Sciweavers

1313 search results - page 26 / 263
» Generic Universe Types
Sort
View
JSYML
2000
78views more  JSYML 2000»
13 years 8 months ago
On Quantification with A Finite Universe
We consider a finite universe U (more exactly - a family U of them), second order quantifiers QK , where for each U this means quantifying over a family of n(K)-place relations clo...
Saharon Shelah
INFOCOM
2010
IEEE
13 years 6 months ago
Resilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space
—We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes...
Wei Zeng, Rik Sarkar, Feng Luo 0002, Xianfeng Gu, ...
FUIN
2002
100views more  FUIN 2002»
13 years 8 months ago
UPSILON: Universal Programming System with Incomplete Lazy Object Notation
This paper presents a new model of computation that differs from prior models in that it emphasizes data over flow control, has no named variables and has an object-oriented flavo...
Brian Postow, Kenneth W. Regan, Carl H. Smith
CALCO
2007
Springer
110views Mathematics» more  CALCO 2007»
14 years 2 months ago
Logical Semantics of Types for Concurrency
We motivate and present a logical semantic approach to types for concurrency and to the soundness of related systems. The approach is illustrated by the development of a generic ty...
Luís Caires
OOPSLA
2005
Springer
14 years 1 months ago
Generalized algebraic data types and object-oriented programming
Generalized algebraic data types (GADTs) have received much attention recently in the functional programming community. They generalize the (type) parameterized algebraic datatype...
Andrew Kennedy, Claudio V. Russo