Sciweavers

11 search results - page 2 / 3
» On Subtyping and Matching
Sort
View
POPL
2006
ACM
14 years 5 months ago
Polymorphic regular tree types and patterns
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
Jerome Vouillon
COORDINATION
2004
Springer
13 years 10 months ago
O'Klaim: A Coordination Language with Mobile Mixins
This paper presents O’KLAIM (Object-Oriented KLAIM), a linguistic extension of the higher-order calculus for mobile processes KLAIM with objectoriented features. Processes intera...
Lorenzo Bettini, Viviana Bono, Betti Venneri
LICS
2000
IEEE
13 years 8 months ago
Efficient and Flexible Matching of Recursive Types
Equality and subtyping of recursive types have been studied in the 1990s by Amadio and Cardelli; Kozen, Palsberg, and Schwartzbach; Brandt and Henglein; and others. Potential appl...
Jens Palsberg, Tian Zhao
JCNS
2010
119views more  JCNS 2010»
13 years 3 months ago
Disentanglement of local field potential sources by independent component analysis
The spontaneous activity of working neurons yields synaptic currents that mix up in the volume conductor. This activity is picked up by intracerebral recording electrodes as local ...
Valeri A. Makarov, Ioulia Makarova, Oscar Herreras
BMCBI
2005
144views more  BMCBI 2005»
13 years 5 months ago
Redefinition of Affymetrix probe sets by sequence overlap with cDNA microarray probes reduces cross-platform inconsistencies in
Background: Comparison of data produced on different microarray platforms often shows surprising discordance. It is not clear whether this discrepancy is caused by noisy data or b...
Scott L. Carter, Aron C. Eklund, Brigham H. Mecham...