Sciweavers

4835 search results - page 399 / 967
» Refactoring Functional Programs
Sort
View
MSCS
2008
87views more  MSCS 2008»
15 years 6 months ago
Coercions in a polymorphic type system
The idea of coercive subtyping, a theory of abbreviation for dependent type theories, is incorporated into the polymorphic type system in functional programming languages. The tra...
Zhaohui Luo
ENTCS
2000
83views more  ENTCS 2000»
15 years 6 months ago
Typed Logical Variables in Haskell
We describe how to embed a simple typed functional logic programming language in Haskell. The embedding is a natural extension of the Prolog embedding by Seres and Spivey [16]. To...
Koen Claessen, Peter Ljunglöf
SMI
2008
IEEE
116views Image Analysis» more  SMI 2008»
16 years 1 months ago
Self-organizing primitives for automated shape composition
Motivated by the ability of living cells to form into specific shapes and structures, we present a new approach to shape modeling based on self-organizing primitives whose behavi...
Linge Bai, Manolya Eyiyurekli, David E. Breen
POPL
1998
ACM
15 years 11 months ago
Higher-Order unCurrying
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
John Hannan, Patrick Hicks
GECCO
2008
Springer
133views Optimization» more  GECCO 2008»
15 years 8 months ago
Using feature-based fitness evaluation in symbolic regression with added noise
Symbolic regression is a popular genetic programming (GP) application. Typically, the fitness function for this task is based on a sum-of-errors, involving the values of the depe...
Janine H. Imada, Brian J. Ross