284 search results - page 7 / 57 » Modularity of Completeness Revisited |
COCOA
2008
Springer
13 years 11 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
ENTCS
2008
13 years 10 months ago
2008
Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. In contrast to ...
LOGCOM
1998
13 years 9 months ago
1998
A sequent calculus of a new sort is extracted from the Prolog program leanTAP. This calculus is sound and complete, even though it lacks almost all structural rules. Thinking of l...
ENTCS
2002
13 years 9 months ago
2002
Modularity and tool support are crucial features for practical use of formal descriptions of programming languages. The combination of unrestricted context-free grammars with acti...
CALCO
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We use coalgebraic methods to describe finitely generated free Heyting algebras. Heyting algebras are axiomatized by rank 0-1 axioms. In the process of constructing free...