Found 2 document(s)
Page 1 of 1
-
This paper establishes cut-elimination for µLL∞ , µLK∞ and µLJ∞ , that are non-wellfounded sequent calculi with least and greatest fixed-points, by expanding on prior works by Santocanale and Fortier [20] as well as Bael...
-
Given that (co)inductive types are naturally modelled as fixed points, it is unsurprising that fixed-point logics are of interest in the study of programming languages, via the Curry-Howard (or proofs-as-programs) corres...