Kahrs, Stefan (1992) Polymorphic Type Checking by Interpretation of Code. Technical report.
|
Download (226Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
|
|
| Postscript | ||
|
Download (181Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_postscript.png)
|
|
Abstract
The type system of most modern functional programming languages is based on Milner's polymorphism. A compiler or interpreter usually checks (or infers) the types of functions and other values by directly inspecting the source code of a program. Here, another approach is taken: The program is first translated into code for a stack machine and then a non-standard interpreter applied to this code checks (or infers) the type of the corresponding values. This can be seen as an abstract interpretation of the object code of the program.
| Item Type: | Monograph (Technical report) |
|---|---|
| Uncontrolled keywords: | type inference, abstract interpretation |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 27 Mar 2010 17:47 |
| Last Modified: | 06 Sep 2011 03:39 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/21028 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
