Applied Type System: An Approach to Practical Programming with Theorem-Proving
Hongwei Xi

TL;DR
This paper introduces the Applied Type System (ATS), a practical framework for designing type systems with advanced features like dependent types, supporting theorem-proving and separating type reasoning from program execution.
Contribution
It presents ATS as a novel type system framework that accommodates practical programming features and theorem-proving, overcoming limitations of Pure Type System (PTS).
Findings
ATS can incorporate dependent types and recursive features.
Supports programming with theorem-proving (PwTP) paradigm.
Formal development and practical examples demonstrate ATS's effectiveness.
Abstract
The framework Pure Type System (PTS) offers a simple and general approach to designing and formalizing type systems. However, in the presence of dependent types, there often exist certain acute problems that make it difficult for PTS to directly accommodate many common realistic programming features such as general recursion, recursive types, effects (e.g., exceptions, references, input/output), etc. In this paper, Applied Type System (ATS) is presented as a framework for designing and formalizing type systems in support of practical programming with advanced types (including dependent types). In particular, it is demonstrated that ATS can readily accommodate a paradigm referred to as programming with theorem-proving (PwTP) in which programs and proofs are constructed in a syntactically intertwined manner, yielding a practical approach to internalizing constraint-solving needed during…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Advanced Software Engineering Methodologies · Software Engineering Research
