Sciweavers

176 search results - page 22 / 36
» Solving Goals in Equational Languages
Sort
View
PPDP
2004
Springer
14 years 28 days ago
A lazy narrowing calculus for declarative constraint programming
The new generic scheme CFLP(D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given ...
Francisco Javier López-Fraguas, Mario Rodr&...
ERLANG
2003
ACM
14 years 25 days ago
Extending the VoDKA architecture to improve resource modelling
VoDKA is a Video-on-Demand server developed using Erlang/OTP. In this paper, the evolution of the core architecture of the system, designed for improving resource modelling, is de...
Juan José Sánchez Penas, Carlos Abal...
CP
2009
Springer
14 years 8 months ago
Filtering Numerical CSPs Using Well-Constrained Subsystems
When interval methods handle systems of equations over the reals, two main types of filtering/contraction algorithms are used to reduce the search space. When the system is well-co...
Ignacio Araya, Gilles Trombettoni, Bertrand Neveu
FOSSACS
2009
Springer
14 years 2 months ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...
IPPS
2007
IEEE
14 years 1 months ago
Speedup using Flowpaths for a Finite Difference Solution of a 3D Parabolic PDE
Partial differential equations (PDEs) are used to model physical phenomena and then appropriate convergent numerical algorithms are employed to solve them and create computer simu...
Darrin M. Hanna, Anna M. Spagnuolo, Michael DuChen...