Sciweavers

4743 search results - page 362 / 949
» Introduction to Functional Programming
Sort
View
GLOBECOM
2007
IEEE
16 years 1 months ago
Robust Chebyshev FIR Equalization
Abstract—In Chebyshev finite-impulse response (FIR) equalization, we design an FIR filter that minimizes the Chebyshev equalization error, i.e., the maximum absolute deviation ...
Almir Mutapcic, Seung-Jean Kim, Stephen P. Boyd
TPHOL
2000
IEEE
15 years 10 months ago
Equational Reasoning via Partial Reflection
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...
Herman Geuvers, Freek Wiedijk, Jan Zwanenburg
FLOPS
2008
Springer
15 years 8 months ago
Rewriting and Call-Time Choice: The HO Case
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
Francisco Javier López-Fraguas, Juan Rodr&i...
148
Voted
APLAS
2009
ACM
16 years 1 months ago
Asymptotic Resource Usage Bounds
When describing the resource usage of a program, it is usual to talk in asymptotic terms, such as the well-known “big O” notation, whereby we focus on the behaviour of the prog...
Elvira Albert, Diego Alonso, Puri Arenas, Samir Ge...
APLAS
2006
ACM
16 years 21 days ago
A Pushdown Machine for Recursive XML Processing
XML transformations are most naturally defined as recursive functions on trees. Their direct implementation, however, causes inefficient memory usage because the input XML tree is...
Keisuke Nakano, Shin-Cheng Mu