Sciweavers

1559 search results - page 11 / 312
» Fundamentals of Generic Programming
Sort
View
MST
2008
121views more  MST 2008»
14 years 9 months ago
Datatype-Generic Termination Proofs
Abstract. Datatype-generic programs are programs that are parameterised by a datatype. We review the allegorical foundations of a methodology of designing datatype-generic programs...
Roland Carl Backhouse, Henk Doornbos
ALIFE
2004
14 years 9 months ago
Basic Autonomy as a Fundamental Step in the Synthesis of Life
In the search for the primary roots of autonomy (a pivotal concept in Varela's comprehensive understanding of living beings), the theory of autopoiesis provided an explicit cr...
Kepa Ruiz-Mirazo, Alvaro Moreno
PLPV
2010
ACM
15 years 6 months ago
Arity-generic datatype-generic programming
Some programs are doubly-generic. For example, map is datatypegeneric in that many different data structures support a mapping operation. A generic programming language like Gener...
Stephanie Weirich, Chris Casinghino
ICFP
2006
ACM
15 years 9 months ago
Context-parametric polykinded types
Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class...
Pablo Nogueira
ISSAC
1997
Springer
194views Mathematics» more  ISSAC 1997»
15 years 1 months ago
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
Qiang Li, Yike Guo, Tetsuo Ida, John Darlington