Sciweavers

429 search results - page 44 / 86
» Polymorphic typed defunctionalization
Sort
View
FLOPS
2008
Springer
13 years 9 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
ENTCS
2007
109views more  ENTCS 2007»
13 years 7 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
BMCBI
2005
105views more  BMCBI 2005»
13 years 7 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
FLOPS
2008
Springer
13 years 9 months ago
Typed Dynamic Control Operators for Delimited Continuations
Abstract. We study the dynamic control operators for delimited continuations, control and prompt. Based on recent developments on purely functional CPS translations for them, we in...
Yukiyoshi Kameyama, Takuo Yonezawa
CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 7 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui