232 search results - page 35 / 47 » Termination of linear bounded term rewriting systems |
LFP
1990
13 years 8 months ago
1990
PCF, as considered in this paper, is a lazy typed lambda calculus with functions, pairing, fixed-point operators and arbitrary algebraic data types. The natural equational axioms ...
WSC
2007
13 years 10 months ago
2007
This paper addresses several issues of using the mathematical programming representations of discrete-event dynamic systems in perturbation analysis. In particular, linear program...
CDC
2009
IEEE
14 years 10 days ago
2009
IEEE
—A high performance adaptive robust control (ARC) algorithm is developed for a class of nonlinear system with unknown input backlash, parametric uncertainties and uncertain nonli...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
CCE
2006
13 years 7 months ago
2006
In this paper, we address the problem of optimal synthesis of an integrated water system, where water using processes and water treatment operations are combined into a single net...