Sciweavers

110 search results - page 18 / 22
» A Tutorial on Proof Theoretic Foundations of Logic Programmi...
Sort
View
SIGSOFT
2003
ACM
14 years 8 months ago
Ontology support for web service processes
Web Services are software services that can be advertised by providers and deployed by customers using Web technologies. This concept is currently carried further to address Web s...
Claus Pahl, Michael Casey
PLDI
2010
ACM
14 years 4 months ago
Ur: Statically-Typed Metaprogramming with Type-Level Record Computation
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
Adam Chlipala
POPL
2012
ACM
12 years 3 months ago
Programming with binders and indexed data-types
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
Andrew Cave, Brigitte Pientka
ATMOS
2007
177views Optimization» more  ATMOS 2007»
13 years 9 months ago
Approximate dynamic programming for rail operations
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
Warren B. Powell, Belgacem Bouzaïene-Ayari
FOCS
1989
IEEE
13 years 11 months ago
Constant Depth Circuits, Fourier Transform, and Learnability
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
Nathan Linial, Yishay Mansour, Noam Nisan