Sciweavers

4498 search results - page 90 / 900
» How to Invent Functions
Sort
View
FLOPS
2004
Springer
14 years 3 months ago
DDT: a Declarative Debugging Tool for Functional-Logic Languages
We present a graphical tool for the declarative debugging of wrong answers in functional-logic languages. The tool, integrated in the system T OY, can be used to navigate a computa...
Rafael Caballero, Mario Rodríguez-Artalejo
AML
2008
47views more  AML 2008»
13 years 10 months ago
Fruitful and helpful ordinal functions
This document is a survey of the four papers [H], [Sch], [Com], [FandH]. It gives the relevant background and shows how the papers fit together to form a whole. Material from thos...
Harold Simmons
IJBRA
2006
61views more  IJBRA 2006»
13 years 10 months ago
Finding functional promoter motifs by computational methods: a word of caution
: The standard practice in the analysis of promoters is to select promoter regions of convenient length. This may lead to false results when searching for Transcription Factor Bind...
Rajesh Chowdhary, Limsoon Wong, Vladimir B. Bajic
EJC
2007
13 years 10 months ago
Symmetric functions, generalized blocks, and permutations with restricted cycle structure
We present various techniques to count proportions of permutations with restricted cycle structure in finite permutation groups. For example, we show how a generalized block theo...
Attila Maróti
MST
2006
105views more  MST 2006»
13 years 10 months ago
Selection Functions that Do Not Preserve Normality
The sequence selected from a sequence R(0)R(1) . . . by a language L is the subsequence of R that contains exactly the bits R(n + 1) such that the prefix R(0) . . . R(n) is in L. B...
Wolfgang Merkle, Jan Reimann