Sciweavers

1805 search results - page 29 / 361
» Functional programming with structured graphs
Sort
View
MP
2002
113views more  MP 2002»
13 years 7 months ago
A note on sensitivity of value functions of mathematical programs with complementarity constraints
Using standard nonlinear programming (NLP) theory, we establish formulas for first and second order directional derivatives for optimal value functions of parametric mathematical ...
Xinmin Hu, Daniel Ralph
ICALP
2009
Springer
14 years 8 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
SOCO
2009
Springer
14 years 2 months ago
Feature (De)composition in Functional Programming
Abstract. The separation of concerns is a fundamental principle in software engineering. Crosscutting concerns are concerns that do not align with hierarchical and block decomposit...
Sven Apel, Christian Kästner, Armin Grö&...
AFP
1995
Springer
128views Formal Methods» more  AFP 1995»
13 years 11 months ago
Monads for Functional Programming
Abstract. The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating effects found in other languages, such as global st...
Philip Wadler
FPLE
1995
13 years 11 months ago
Explaining Algebraic Theory with Functional Programs
Abstract. A hierarchy of six important structures from abstract algebra (groups, rings, fields etc.) is introduced as Gofer class definitions and laws about them. Many instance d...
Jeroen Fokker