Sciweavers

4757 search results - page 426 / 952
» Monads for Functional Programming
Sort
View
ICFP
2001
ACM
16 years 6 months ago
Compositional Explanation of Types and Algorithmic Debugging of Type Errors
The type systems of most typed functional programming languages are based on the Hindley-Milner type system. A practical problem with these type systems is that it is often hard t...
Olaf Chitil
ICRA
2007
IEEE
163views Robotics» more  ICRA 2007»
16 years 1 months ago
Implementing a Control System Framework for Automatic Generation of Manufacturing Cell Controllers
— Quickly adapting the manufacturing system to the production of new or modified products is critical for manufacturers in order to stay competitive. For flexible manufacturing...
Oscar Ljungkrantz, Knut Akesson, Johan Richardsson...
PPDP
2007
Springer
16 years 28 days ago
A simple rewrite notion for call-time choice semantics
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
Francisco Javier López-Fraguas, Juan Rodr&i...
HICSS
2006
IEEE
115views Biometrics» more  HICSS 2006»
16 years 26 days ago
Enterprise Architecture Implementation and Management: A Case Study on Interoperability
The focus of this study is to explore why public agencies implement enterprise architecture programs and the interoperability challenges they are faced with when governing these p...
Kristian Hjort-Madsen
IPPS
2006
IEEE
16 years 25 days ago
Bio-sequence database scanning on a GPU
Protein sequences with unknown functionality are often compared to a set of known sequences to detect functional similarities. Efficient dynamic programming algorithms exist for t...
Weiguo Liu, Bertil Schmidt, Gerrit Voss, Adrian Sc...