TiML: a functional language for practical complexity analysis with invariants
We present TiML (Timed ML), an ML-like functional language with time-complexity annotations in types. It uses indexed types to express sizes of data structures and upper bounds on running time of functions; and refinement kinds to constrain these indices, expressing data-structure invariants and pre...
| Main Authors: | , , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Association for Computing Machinery (ACM),
2019-06-10T18:00:00Z.
|
| Subjects: | |
| Online Access: | Get fulltext |