Sciweavers

429 search results - page 40 / 86
» Parameter-free polymorphic types
Sort
View
FLOPS
2008
Springer
15 years 1 months 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
CORR
2008
Springer
94views Education» more  CORR 2008»
14 years 10 months ago
Semi-continuous Sized Types and Termination
A type-based approach to termination uses sized types: an ordinal bound for the size of a data structure is stored in its type. A recursive function over a sized type is accepted i...
Andreas Abel
ENTCS
2007
109views more  ENTCS 2007»
14 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
CORR
2010
Springer
121views Education» more  CORR 2010»
14 years 9 months ago
MiniAgda: Integrating Sized and Dependent Types
Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track ...
Andreas Abel
BMCBI
2005
105views more  BMCBI 2005»
14 years 11 months ago
SNPHunter: a bioinformatic software for single nucleotide polymorphism data acquisition and management
Background: Single nucleotide polymorphisms (SNPs) provide an important tool in pinpointing susceptibility genes for complex diseases and in unveiling human molecular evolution. S...
Lin Wang, Simin Liu, Tianhua Niu, Xin Xu