Work

Cyclic Implicit Complexity

Year: 2022

Type: conference-paper

Abstract: Circular (or cyclic) proofs have received increasing attention in recent years, and have been proposed as an alternative setting for studying (co)inductive reasoning. In particular, now several type systems based on circular reasoning have been proposed. However, little is known about the complexity theoretic aspects of circular proofs, which exhibit sophisticated loop structures atypical of more common ‘recursion schemes’.

Source: ACM/IEEE Symposium on Logic in Computer Science (LICS)

DOI: 10.1145/3531130.3533340

Authors: Gianluca Curzi, Anupam Das

Institution: University of Birmingham

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: UK Research and Innovation

Award: G8996976171