Sciweavers

1559 search results - page 60 / 312
» Fundamentals of Generic Programming
Sort
View
TLCA
2007
Springer
15 years 3 months ago
Higher-Order Logic Programming Languages with Constraints: A Semantics
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
James Lipton, Susana Nieva
STACS
2009
Springer
15 years 4 months ago
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
51
Voted
ORL
2008
50views more  ORL 2008»
14 years 9 months ago
Exploiting equalities in polynomial programming
We propose a novel solution approach for polynomial programming problems with equality constraints. By means of a generic transformation, we show that solution schemes for the (ty...
Javier Peña, Juan Carlos Vera, Luis F. Zulu...
ECOOP
2007
Springer
15 years 3 months ago
Morphing: Safely Shaping a Class in the Image of Others
We present MJ: a language for specifying general classes whose members are produced by iterating over members of other classes. We call this technique “class morphing” or just ...
Shan Shan Huang, David Zook, Yannis Smaragdakis
GPCE
2003
Springer
15 years 2 months ago
Concept-Controlled Polymorphism
Concepts—sets of abstractions related by common requirements— have a central role in generic programming. This paper proposes a general framework for using concepts to control ...
Jaakko Järvi, Jeremiah Willcock, Andrew Lumsd...