69 search results - page 5 / 14 » Explaining Algebraic Theory with Functional Programs |
IWPC
2009
IEEE
14 years 2 months ago
2009
IEEE
Comprehending an unfamiliar code fragment requires an awareness of explicit usage directives that may be present in the documentation of some invoked functions. Since it is not pr...
OOPSLA
2005
Springer
14 years 29 days ago
2005
Springer
Generalized algebraic data types (GADTs) have received much attention recently in the functional programming community. They generalize the (type) parameterized algebraic datatype...
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
13 years 11 months ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
TLCA
2007
Springer
14 years 1 months ago
2007
Springer
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
JLP
2007
13 years 7 months ago
2007
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...