Sciweavers

4498 search results - page 446 / 900
» How to Invent Functions
Sort
View
CADE
2006
Springer
16 years 7 months ago
Combining Type Theory and Untyped Set Theory
Abstract. We describe a second-order type theory with proof irrelevance. Within this framework, we give a representation of a form of Mac Lane set theory and discuss automated supp...
Chad E. Brown
VLDB
2007
ACM
139views Database» more  VLDB 2007»
16 years 7 months ago
FuSem - Exploring Different Semantics of Data Fusion
Data fusion is the final step of a typical data integration process, after schematic conflicts have been overcome and after duplicates have been correctly identified. We present t...
Jens Bleiholder, Karsten Draba, Felix Naumann
ICFP
2006
ACM
16 years 6 months ago
The development of Chez Scheme
Chez Scheme is now over 20 years old, the first version having been released in 1985. This paper takes a brief look back on the history of Chez Scheme's development to explor...
R. Kent Dybvig
ICFP
2005
ACM
16 years 6 months ago
Qualified types for MLF
MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a loca...
Andres Löh, Daan Leijen

Publication
243views
16 years 5 months ago
A Java-based Wrapper for Wireless Communications
The increasing number of new applications for mobile devices in pervasive environments, do not cope with changes in the wireless communications. Developers of such applications hav...
Alessandro Genco, Antonio Gentile, Cono Ferrarotto...