Sciweavers

1809 search results - page 4 / 362
» Calculating Sized Types
Sort
View
CSL
2005
Springer
14 years 28 days ago
Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
Frédéric Blanqui
CSL
2008
Springer
13 years 9 months ago
Type-Based Termination with Sized Products
Type-based termination is a semantically intuitive method that ensures termination of recursive definitions by tracking the size of datatype elements, and by checking that recursiv...
Gilles Barthe, Benjamin Grégoire, Colin Rib...
CSL
2009
Springer
14 years 2 months ago
On the Relation between Sized-Types Based Termination and Semantic Labelling
We investigate the relationship between two independently developed termination techniques for rst and higher-order rewrite systems. On the one hand, sized-types based termination...
Frédéric Blanqui, Cody Roux
TIC
2000
Springer
110views System Software» more  TIC 2000»
13 years 11 months ago
Program Representation Size in an Intermediate Language with Intersection and Union Types
Abstract. The CIL compiler for core Standard ML compiles whole programs using a novel typed intermediate language (TIL) with intersection and union types and flow labels on both te...
Allyn Dimock, Ian Westmacott, Robert Muller, Frank...
FOCS
2009
IEEE
14 years 2 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra