Sciweavers

1313 search results - page 40 / 263
» Generic Universe Types
Sort
View
STACS
2001
Springer
14 years 27 days ago
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
Philipp Woelfel
TACS
1997
Springer
14 years 18 days ago
Optimal Representations of Polymorphic Types with Subtyping (Extended Abstract)
d Abstract) Alexander Aiken1 and Edward L. Wimmers2 and Jens Palsberg3 1 EECS Department, University of California at Berkeley, Berkeley, CA 94720-1776. 2 IBM Almaden Research Cent...
Alexander Aiken, Edward L. Wimmers, Jens Palsberg
CSL
2000
Springer
14 years 25 days ago
Subtyping with Power Types
This paper introduces a typed λ-calculus called λPower , a predicative reformulation of part of Cardelli’s power type system. Power types integrate subtyping into the typing t...
David Aspinall
CLEF
2010
Springer
13 years 9 months ago
The University of Amsterdam's Concept Detection System at ImageCLEF 2010
Our group within the University of Amsterdam participated in the large-scale visual concept detection task of ImageCLEF 2010. The submissions from our visual concept detection sys...
Koen E. A. van de Sande, Theo Gevers
JSYML
2008
66views more  JSYML 2008»
13 years 8 months ago
Flat algebras and the translation of universal Horn logic to equational logic
We describe which subdirectly irreducible flat algebras arise in the variety generated by an arbitrary class of flat algebras with absorbing bottom element. This is used to give an...
Marcel Jackson