Sciweavers

4498 search results - page 55 / 900
» How to Invent Functions
Sort
View
IFL
2000
Springer
135views Formal Methods» more  IFL 2000»
13 years 11 months ago
Freja, Hat and Hood - A Comparative Evaluation of Three Systems for Tracing and Debugging Lazy Functional Programs
Abstract. In this paper we compare three systems for tracing and debugging Haskell programs: Freja, Hat and Hood. We evaluate their usefulness in practice by applying them to a num...
Olaf Chitil, Colin Runciman, Malcolm Wallace
COMBINATORICS
2002
60views more  COMBINATORICS 2002»
13 years 7 months ago
Parking Functions, Stack-Sortable Permutations, and Spaces of Paths in the Johnson Graph
We prove that the space of possible final configurations for a parking problem is parameterized by the vertices of a regular Bruhat graph associated to a 231-avoiding permutation,...
Catalin Zara
LISP
2002
78views more  LISP 2002»
13 years 7 months ago
Functional Geometry
An algebra of pictures is described that is sufficiently powerful to denote the structure of a well-known Escher woodcut, Square Limit. A decomposition of the picture that is reaso...
Peter Henderson
IGPL
2010
92views more  IGPL 2010»
13 years 6 months ago
The weight of competence under a realistic loss function
In many scientific, economic and policy-related problems, pieces of information from different sources have to be aggregated. Typically, the sources are not equally competent. T...
Stephan Hartmann, Jan Sprenger
CIE
2006
Springer
13 years 11 months ago
Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions
In this paper we first survey recent advances on phase transition phenomena which are related to natural subclasses of the recursive functions. Special emphasis is put on descent ...
Andreas Weiermann