Sciweavers

1614 search results - page 195 / 323
» Polymorphism and Genetic Programming
Sort
View
APLAS
2001
ACM
14 years 2 months ago
Verifying the CPS Transformation in Isabelle/HOL
We verified two versions of the CPS transformation in Isabelle/HOL: one by Plotkin by Danvy and Filinski. We adopted first order abstract syntax so that the formalization is close...
Yasuhiko Minamide, Koji Okuma
FLOPS
2008
Springer
14 years 16 days ago
On-Demand Refinement of Dependent Types
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
Hiroshi Unno, Naoki Kobayashi
BMCBI
2008
73views more  BMCBI 2008»
13 years 11 months ago
Parallel and serial computing tools for testing single-locus and epistatic SNP effects of quantitative traits in genome-wide ass
Background: Genome-wide association studies (GWAS) using single nucleotide polymorphism (SNP) markers provide opportunities to detect epistatic SNPs associated with quantitative t...
Li Ma, H. Birali Runesha, Daniel Dvorkin, John R. ...
ENTCS
2007
109views more  ENTCS 2007»
13 years 11 months ago
Free Theorems and Runtime Type Representations
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
Dimitrios Vytiniotis, Stephanie Weirich
TCS
2011
13 years 6 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann