Sciweavers

4257 search results - page 293 / 852
» The Logical Modularity of Programs
Sort
View
DISOPT
2008
82views more  DISOPT 2008»
15 years 6 months ago
Note on pseudolattices, lattices and submodular linear programs
A pseudolattice L is a poset with lattice-type binary operations. Assuming that the pseudolattice permits a modular representation as a family of subsets of a set U with certain c...
Ulrich Faigle, Britta Peis
AI
2000
Springer
15 years 6 months ago
Using temporal logics to express search control knowledge for planning
Over the years increasingly sophisticated planning algorithms have been developed. These have made for more efficient planners, but unfortunately these planners still suffer from ...
Fahiem Bacchus, Froduald Kabanza
FMSD
2002
81views more  FMSD 2002»
15 years 6 months ago
A Notation and Logic for Mobile Computing
Abstract. We de ne a concurrent mobile system as one where independently executing components may migrate through some space during the course of the computation, and where the pat...
Gruia-Catalin Roman, Peter J. McCann
ICFP
2007
ACM
16 years 6 months ago
Call-pattern specialisation for haskell programs
User-defined data types, pattern-matching, and recursion are ubiquitous features of Haskell programs. Sometimes a function is called with arguments that are statically known to be...
Simon L. Peyton Jones
KBSE
2008
IEEE
16 years 1 months ago
XE (eXtreme Editor) - Bridging the Aspect-Oriented Programming Usability Gap
—In spite of the modularization benefits supported by the Aspect-Oriented programming paradigm, different usability issues have hindered its adoption. The decoupling between asp...
Wiwat Ruengmee, Roberto Silveira Silva Filho, Sush...