Sciweavers

8132 search results - page 97 / 1627
» Dependability, Abstraction, and Programming
Sort
View
PADL
2010
Springer
15 years 7 months ago
Conversion by Evaluation
Abstract. We show how testing convertibility of two types in dependently typed systems can advantageously be implemented instead untyped normalization by evaluation, thereby reusin...
Mathieu Boespflug
AI
2009
Springer
15 years 4 months ago
Novice-Friendly Natural Language Generation Template Authoring Environment
Abstract. Natural Language Generation (NLG) systems can make data accessible in an easily digestible textual form; but using such systems requires sophisticated linguistic and some...
Maria Fernanda Caropreso, Diana Inkpen, Shahzad Kh...
ASPDAC
2004
ACM
97views Hardware» more  ASPDAC 2004»
15 years 3 months ago
A cosynthesis algorithm for application specific processors with heterogeneous datapaths
Abstract- This paper proposes a hardwadsoftware cosynthesis algorithm for processors with heterogeneous registers. Given a CDFG correspondingto an application program and a timing ...
Yuichiro Miyaoka, Nozomu Togawa, Masao Yanagisawa,...
CP
2004
Springer
15 years 3 months ago
The Tractability of Global Constraints
Abstract. Constraint propagation is one of the techniques central to the success of constraint programming. Fast algorithms are used to prune the search space either before or duri...
Christian Bessière, Emmanuel Hebrard, Brahi...
AC
2003
Springer
15 years 3 months ago
Generic Haskell: Applications
Generic Haskell is an extension of Haskell that supports the construction of generic programs. These lecture notes discuss three advanced generic programming applications: generic ...
Ralf Hinze, Johan Jeuring