Sciweavers

255 search results - page 3 / 51
» Synthesis of Functions Using Generic Programming
Sort
View
ICCAD
2007
IEEE
139views Hardware» more  ICCAD 2007»
15 years 5 months ago
Using functional independence conditions to optimize the performance of latency-insensitive systems
—In latency-insensitive design shell modules are used to encapsulate system components (pearls) in order to interface them with the given latency-insensitive protocol and dynamic...
Cheng-Hong Li, Luca P. Carloni
ICFP
2005
ACM
15 years 11 months ago
Scrap your boilerplate with class: extensible generic functions
The `Scrap your boilerplate' approach to generic programming allows the programmer to write generic functions that can traverse arbitrary data structures, and yet have type-s...
Ralf Lämmel, Simon L. Peyton Jones
CORR
2010
Springer
153views Education» more  CORR 2010»
14 years 11 months ago
The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
Roberto Bagnara, Fred Mesnard, Andrea Pescetti, En...
AOSD
2010
ACM
15 years 6 months ago
Weaving generic programming and traversal performance
The development of complex software requires the implementation of functions over a variety of recursively defined data structures. The design (and modeling) of structures can it...
Bryan Chadwick, Karl J. Lieberherr
ICFP
2008
ACM
15 years 11 months ago
Scala for generic programmers
Datatype-generic programming involves parametrization by the shape of data, in the form of type constructors such as `list of'. Most approaches to datatype-generic programmin...
Bruno C. D. S. Oliveira, Jeremy Gibbons