Upper bounds on stream I/O using semantic interpretations
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Global and local space properties of stream programs
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Software Code Generation for the RVC-CAL Language
Journal of Signal Processing Systems
Resource analysis by sup-interpretation
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Synchronous digital circuits as functional programs
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
We describe work-in-progress which aims at compilingsuitably restricted functional programs with lazy lists directlyinto hardware. This extends previous work on SAFLwhich demonstrated that functional languages are effectiveat describing "fire-and-wait-for-result" programs, but forwhich stream-like I/O was awkward or impossible. Otherframeworks (e.g. Lava) have used functional languages asa form of macro-language, so that executing a program generatesa net-list (structural) description, while our languageis compiled directly ("behaviourally") to hardware. In particularour stream operations (represented as creation andpattern matching of lazy CONS cells) are mapped into channelwrites and reads. We introduce our language, SASL,compare our approach to that of synchronous stream/signallanguages, and give example functional descriptions whichcan be compiled to hardware.