Sciweavers

4757 search results - page 88 / 952
» Monads for Functional Programming
Sort
View
IPL
2007
78views more  IPL 2007»
13 years 9 months ago
Ensuring the quasi-termination of needed narrowing computations
We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in the...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
CORR
2007
Springer
82views Education» more  CORR 2007»
13 years 9 months ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud
ICFP
2004
ACM
14 years 9 months ago
Implementing functional logic languages using multiple threads and stores
Recent functional logic languages such as Curry and Toy combine lazy functional programming with logic programming features including logic variables, non-determinism, unification...
Andrew P. Tolmach, Sergio Antoy, Marius Nita
POPL
2012
ACM
12 years 5 months ago
A type theory for probability density functions
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...
Sooraj Bhat, Ashish Agarwal, Richard W. Vuduc, Ale...
SIAMJO
2010
100views more  SIAMJO 2010»
13 years 4 months ago
Optimality Conditions via Exact Penalty Functions
Abstract: In this paper, we study KKT optimality conditions for constrained nonlinear programming problems and strong and Mordukhovich stationarities for mathematical
K. W. Meng, X. Q. Yang