Sciweavers

4757 search results - page 390 / 952
» Monads for Functional Programming
Sort
View
IFL
2005
Springer
116views Formal Methods» more  IFL 2005»
16 years 8 days ago
Proof Tool Support for Explicit Strictness
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
Marko C. J. D. van Eekelen, Maarten de Mol
APLAS
2004
ACM
16 years 5 days ago
An Algebraic Approach to Bi-directional Updating
In many occasions would one encounter the task of maintaining the consistency of two pieces of structured data that are related by some transform — synchronising bookmarks in diď...
Shin-Cheng Mu, Zhenjiang Hu, Masato Takeichi
ASPDAC
2004
ACM
97views Hardware» more  ASPDAC 2004»
16 years 5 days 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,...
174
Voted
ERLANG
2004
ACM
16 years 5 days ago
On modelling agent systems with Erlang
Multi-agent systems are a kind of concurrent distributed systems. In this work, some guidelines on how to create multi-agent systems using Erlang are presented. The modelled syste...
Carlos Varela, Carlos Abalde, Laura M. Castro, Jos...
GPCE
2003
Springer
15 years 12 months ago
Concept-Controlled Polymorphism
Concepts—sets of abstractions related by common requirements— have a central role in generic programming. This paper proposes a general framework for using concepts to control ...
Jaakko Järvi, Jeremiah Willcock, Andrew Lumsd...