Sciweavers

249 search results - page 29 / 50
» Polymorphic Binding-Time Analysis
Sort
View
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
OOPSLA
2004
Springer
14 years 23 days ago
Modular generics
This paper presents the design of G, a new language specifically created for generic programming. We review and identify important language features of C++ and Haskell in light o...
Jeremy G. Siek
EDOC
2003
IEEE
14 years 21 days ago
MQL: a Powerful Extension to OCL for MOF Queries
The Meta-Object Facility (MOF) provides a standardised framework for object-oriented models. An instance of a MOF model contains objects and links whose interfaces are entirely de...
David Hearnden, Kerry Raymond, Jim Steel
AI
2006
Springer
13 years 7 months ago
The complexity of soft constraint satisfaction
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint type...
David A. Cohen, Martin C. Cooper, Peter Jeavons, A...
BMCBI
2006
97views more  BMCBI 2006»
13 years 7 months ago
PDA: Pooled DNA analyzer
Background: Association mapping using abundant single nucleotide polymorphisms is a powerful tool for identifying disease susceptibility genes for complex traits and exploring pos...
Hsin-Chou Yang, Chia-Ching Pan, Chin-Yu Lin, Cathy...