60 search results - page 8 / 12 » Recursive Definitions of Monadic Functions |
ISCAS
1994
IEEE
15 years 1 months ago
1994
IEEE
Abstract: Modified sign Haar transform with sign Walsh-like structure is introduced in this article. This nonlinear transform converts binary/ternary vectors into digital spectral ...
101
click to vote
CIE
2008
Springer
14 years 11 months ago
2008
Springer
Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent...
100
click to vote
CSL
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...
NJC
2000
14 years 9 months ago
2000
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
CSL
2008
Springer
14 years 11 months ago
2008
Springer
Type-based termination is a semantically intuitive method that ensures termination of recursive definitions by tracking the size of datatype elements, and by checking that recursiv...