May 13, 2021 · In this paper, we adapt sized types and their metatheory to the concurrent setting. We extend the semi-axiomatic sequent calculus, a subsuming ...

Abstract. In sequential functional languages, sized types enable termination checking of programs with complex patterns of recursion in the presence of ...

Apr 15, 2024 · Key words and phrases: type-based termination, sized types, futures, concurrency, infinite proofs. ... TYPE-BASED TERMINATION FOR FUTURES. 3.

Jun 28, 2022 · In this paper, we adapt sized types and their metatheory to the concurrent setting. We extend the semi-axiomatic sequent calculus, a subsuming ...

The first part of the thesis presents a mechanism that ensures termination through types and defines a system that incorporates it. More precisely, we formalize ...

This paper extends a core language for persistent shared memory concurrency based on the semi-axiomatic sequent calculus with recursive types and arithmetic ...

In summary, type-based termination appears as a suitable approach to guar- antee strong normalization of typable terms, which in the near future may well.

Sep 29, 2017 · But now I want to terminate other download-search operation started under Future as given search is expected to be found in only one of the ...

Finding sufficient conditions with subtyping and dependent types does not seem easy. We leave the study of this problem for future work. With dependent or.

In Section 4 we prove that all instances of generic programs are well-typed which entails termination. More related work and directions for future research are ...