Skip to content

ComputationWithBoundedResources/hoca

Repository files navigation

Higher-Order Complexity Analysis

Automatic complexity analysis tool for higher-order systems. Currently it can translate a pure fragment of OCaml to first-order term rewrite systems (TRSs for short).

Install

For building, you need ghc and cabal. To install, type cabal install in the root source folder.

Usage

A program is specified as lambda-term enrichted by let, let rec and match expressions. See the examples directory for the syntax of programs. To translate a program to a TRS, type pcf2trs <file> where <file> specifies the input program. For full options, type pcf2trs --help.

About

Automatic complexity analysis tool for higher-order systems

Resources

License

Stars

Watchers

Forks

Packages

No packages published