Sciweavers

213 search results - page 30 / 43
» Logic programs with annotated disjunctions
Sort
View
POPL
2006
ACM
14 years 8 months ago
Stratified type inference for generalized algebraic data types
We offer a solution to the type inference problem for an extension of Hindley and Milner's type system with generalized algebraic data types. Our approach is in two strata. T...
François Pottier, Yann Régis-Gianas
ICFP
2005
ACM
14 years 1 months ago
Fast narrowing-driven partial evaluation for inductively sequential programs
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
PEPM
2007
ACM
14 years 2 months ago
Tasks: language support for event-driven programming
The event-driven programming style is pervasive as an efficient method for interacting with the environment. Unfortunately, the event-driven style severely complicates program mai...
Jeffrey Fischer, Rupak Majumdar, Todd D. Millstein
BMCBI
2004
229views more  BMCBI 2004»
13 years 7 months ago
Automatic annotation of protein motif function with Gene Ontology terms
Background: Conserved protein sequence motifs are short stretches of amino acid sequence patterns that potentially encode the function of proteins. Several sequence pattern search...
Xinghua Lu, Chengxiang Zhai, Vanathi Gopalakrishna...
ICFP
2005
ACM
14 years 8 months ago
Simple, partial type-inference for System F based on type-containment
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
Didier Rémy