Literature survey of type inference algorithms for statically typed languages

Title

Literature survey of type inference algorithms for statically typed languages

 Author

Jakovonis, Saulius (TU Delft Electrical Engineering, Mathematics and Computer Science)

Contributor

Cockx, J.G.H. (mentor)
Liesnikov, B. (mentor)
Panichella, A. (graduation committee) ORCID 0000-0002-7395-3588

 Degree granting institution

Delft University of Technology

 Programme

Computer Science and Engineering

 Project

CSE3000 Research Project

 Date

2023-06-28

 Abstract

The success of dynamically typed languages such as Python has resulted in an increased interest in supporting type inference in statically typed lan- guages. Type inference refers to automatic type detection based on surrounding context and allows retaining the type safety (and other advantages) of static types, while matching the ease of use of dy- namically typed languages. Unfortunately, imple- menting type inference can be tricky. Researchers have been proposing various methods for type in- ference ever since the 1970s, however there is no single solution that works for all languages. This paper presents and analyses the proposed methods together with motivations, intuitions, use-cases and examples from practice with the aim of helping new programming language developers understand type inference principles and choose the right technique for their needs.

 Subject

Type Inference
Algorithms
Statically Typed
Type Checking
Programming Languages

 To reference this document use:

http://resolver.tudelft.nl/uuid:43d4ce8e-378c-4942-bd03-6c7f3ba8387a

 Part of collection

Student theses

 Document type

bachelor thesis

 Rights

© 2023 Saulius Jakovonis
Files
PDF Research_Paper_Final_2.pdf 201.83 KB
Close viewer