Sciweavers

1055 search results - page 203 / 211
» Enumerations in computable structure theory
Sort
View
ICFP
2003
ACM
14 years 7 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
PEPM
2009
ACM
14 years 4 months ago
Bidirectional data-flow analyses, type-systematically
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
Maria João Frade, Ando Saabas, Tarmo Uustal...
ATAL
2009
Springer
14 years 2 months ago
First principles planning in BDI systems
BDI (Belief, Desire, Intention) agent systems are very powerful, but they lack the ability to incorporate planning. There has been some previous work to incorporate planning withi...
Lavindra de Silva, Sebastian Sardiña, Lin P...
RECSYS
2009
ACM
14 years 2 months ago
An incentive-based architecture for social recommendations
We present an incentive-based architecture for providing recommendations in a social network. We maintain a distinct reputation system for each individual and we rely on users to ...
Rajat Bhattacharjee, Ashish Goel, Konstantinos Kol...
WIKIS
2009
ACM
14 years 2 months ago
Organizing the vision for web 2.0: a study of the evolution of the concept in Wikipedia
Information Systems (IS) innovations are often characterized by buzzwords, reflecting organizing visions that structure and express the images and ideas formed by a wide community...
Arnaud Gorgeon, E. Burton Swanson