Sciweavers

300 search results - page 2 / 60
» Subset Types and Partial Functions
Sort
View
POPL
2006
ACM
14 years 5 months ago
Fast and loose reasoning is morally correct
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
Nils Anders Danielsson, John Hughes, Patrik Jansso...
BMCBI
2010
111views more  BMCBI 2010»
13 years 5 months ago
Functional Analysis: Evaluation of Response Intensities - Tailoring ANOVA for Lists of Expression Subsets
Background: Microarray data is frequently used to characterize the expression profile of a whole genome and to compare the characteristics of that genome under several conditions....
Fabrice Berger, Bertrand De Meulder, Anthoula Gaig...
IJBC
2007
86views more  IJBC 2007»
13 years 4 months ago
Optimization and the Miranda Approach in Detecting Horseshoe-Type Chaos by Computer
f of the underlying abstract theorem avoids of referring to any results of applied algebraic topology and relies only on the Brouwer fixed point theorem. The second novelty is tha...
Balázs Bánhelyi, Tibor Csendes, Barn...
PEPM
1998
ACM
13 years 9 months ago
Type-Directed Partial Evaluation
Abstract. We use a code generator--type-directed partial evaluation-to verify conversions between isomorphic types, or more precisely to verify that a composite function is the ide...
Olivier Danvy
CADE
1998
Springer
13 years 9 months ago
Admissibility of Fixpoint Induction over Partial Types
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
Karl Crary