Sciweavers

3591 search results - page 45 / 719
» Typing linear constraints
Sort
View
CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 10 months ago
Light types for polynomial time computation in lambda-calculus
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...
Patrick Baillot, Kazushige Terui
POPL
2001
ACM
14 years 11 months ago
Colored local type inference
We present a type system for a language based on F, which allows certain type annotations to be elided in actual programs. Local type inference determines types by a combination o...
Martin Odersky, Christoph Zenger, Matthias Zenger
MOC
2000
62views more  MOC 2000»
13 years 10 months ago
Uzawa type algorithms for nonsymmetric saddle point problems
In this paper, we consider iterative algorithms of Uzawa type for solving linear nonsymmetric saddle point problems. Specifically, we consider systems, written as usual in block fo...
James H. Bramble, Joseph E. Pasciak, Apostol T. Va...
ASPDAC
2004
ACM
144views Hardware» more  ASPDAC 2004»
14 years 2 months ago
Verification of timed circuits with symbolic delays
When time is incorporated in the specification of discrete systems, the complexity of verification grows exponentially. When the temporal behavior is specified with symbols, the ve...
Robert Clarisó, Jordi Cortadella
ECOOP
2007
Springer
14 years 2 months ago
Tracking Linear and Affine Resources with Java(X)
Java(X) is a framework for type refinement. It extends Java's type language with annotations drawn from an algebra X and structural subtyping in terms of the annotations. Each...
Markus Degen, Peter Thiemann, Stefan Wehr