Complete Call-by-Value Calculi of Control Operators II: Strong Termination

July 07, 2017 · The Ethereal · 🏛 Log. Methods Comput. Sci.

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Ryu Hasegawa arXiv ID 1707.02034 Category cs.LO: Logic in CS Cross-listed cs.PL Citations 0 Venue Log. Methods Comput. Sci. Last Checked 5 months ago
Abstract
We provide characterization of the strong termination property of the CCV (complete call-by-value) lambda-mu calculus introduced in the first part of this series of the paper. The calculus is complete with respect to the standard continuation-passing style (CPS) semantics. The union-intersection type systems for the calculus is developed in the previous paper. We characterize the strong normalizability of terms of the calculus in terms of the CPS semantics and typeability.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Logic in CS