Abstract
Type systems are moving beyond the realm of data structure and into more complex domains like security and networking.
- Hindley, J.R. Basic Simple Type Theory. Cambridge University Press, new York, 2008. Google ScholarDigital Library
- Pierce, B. Types and Programming Languages. MIT Press, Cambridge, MA, 2002. Google ScholarDigital Library
- Flanagan, C. hybrid type checking. SIGPLAN Notices 41, 1, Jan. 2006. Google ScholarDigital Library
- Cardelli, L. Type systems. The Computer Science and Engineering Handbook, Allen B. Tucker (ed.). CRC Press, Boca Raton, FL, 1996.Google Scholar
- Church, A. A formulation of the simple theory of types. Journal of Symbolic Logic 5, 2, 1940.Google ScholarCross Ref
Index Terms
- Type theory comes of age
Recommendations
Partial Gradual Dependent Type Theory
SPLASH 2023: Companion Proceedings of the 2023 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for HumanityGradual typing supports imprecise types in the type system, allowing incremental migration from untyped code to typed in the same language. Through the gradual typing approach, our ongoing work proposes a new theory based on the Martin-Löf type theory ...
Parametric quantifiers for dependent type theory
Polymorphic type systems such as System F enjoy the parametricity property: polymorphic functions cannot inspect their type argument and will therefore apply the same algorithm to any type they are instantiated on. This idea is formalized mathematically ...
Gradual type theory
Gradually typed languages are designed to support both dynamically typed and statically typed programming styles while preserving the benefits of each. While existing gradual type soundness theorems for these languages aim to show that type-based ...
Comments