Sciweavers

2343 search results - page 82 / 469
» Structure and Interpretation of Computer Programs
Sort
View
POPL
2012
ACM
14 years 8 days ago
Higher-order functional reactive programming in bounded space
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
Neelakantan R. Krishnaswami, Nick Benton, Jan Hoff...
ITSSA
2006
116views more  ITSSA 2006»
15 years 4 months ago
A Genetic Programming Approach to Automated Test Generation for Object-Oriented Software
: This article proposes a new method for creating test software for object-oriented systems using a genetic programming approach. It is believed that this approach is advantageous ...
Arjan Seesing, Hans-Gerhard Groß
FCCM
2000
IEEE
133views VLSI» more  FCCM 2000»
15 years 9 months ago
Configuration Caching Management Techniques for Reconfigurable Computing
Although run-time reconfigurable systems have been shown to achieve very high performance, the speedups over traditional microprocessor systems are limited by the cost of configur...
Zhiyuan Li, Katherine Compton, Scott Hauck
ICFP
2010
ACM
15 years 5 months ago
VeriML: typed computation of logical terms inside a language with effects
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
Antonis Stampoulis, Zhong Shao
ISSAC
2007
Springer
111views Mathematics» more  ISSAC 2007»
15 years 11 months ago
Numerical optimization in hybrid symbolic-numeric computation
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
Lihong Zhi