Polynomial Size Analysis of First-Order Shapely Functions
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly by a polynomial in the sizes of the arguments. Examples of shapely function definitions may be implementations of matrix m...
Main Authors: | Olha Shkaravska, Marko van Eekelen, Ron van Kesteren |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2009-05-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/1148/pdf |
Similar Items
-
Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic
by: Vincent Atassi, et al.
Published: (2007-11-01) -
Petri Net Reachability Graphs: Decidability Status of First Order Properties
by: Philippe Darondeau, et al.
Published: (2012-10-01) -
Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds
by: Lars Kuhtz, et al.
Published: (2012-10-01) -
Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
by: Libor Barto, et al.
Published: (2012-02-01) -
The complexity of global cardinality constraints
by: Andrei A. Bulatov, et al.
Published: (2010-10-01)