Skip to main content

Polymorphic Type Checking by Interpretation of Code

Kahrs, Stefan (1992) Polymorphic Type Checking by Interpretation of Code. Technical report. (KAR id:21028)

PDF
Language: English
Click to download this file (247kB) Preview
[thumbnail of PolyKS.pdf]
Preview
This file may not be suitable for users of assistive technology.
Request an accessible format
Postscript
Language: English
Click to download this file (186kB) Preview
[thumbnail of PolyKS.ps]
Preview
This file may not be suitable for users of assistive technology.
Request an accessible format

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: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 27 Mar 2010 17:47 UTC
Last Modified: 16 Nov 2021 09:59 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/21028 (The current URI for this page, for reference purposes)
Kahrs, Stefan: https://orcid.org/0000-0001-5099-9375
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.