Kahrs, Stefan (1992) Polymorphic Type Checking by Interpretation of Code. Technical report. (KAR id:21028)
|
PDF
Language: English |
|
|
Download this file (PDF/247kB) |
Preview |
| Request a format suitable for use with assistive technology e.g. a screenreader | |
|
Postscript
Language: English |
|
|
Download this file (Postscript/186kB) |
Preview |
| Request a format suitable for use with assistive technology e.g. a screenreader | |
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: | Reports and Papers (Technical report) |
|---|---|
| Uncontrolled keywords: | type inference, abstract interpretation |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Institutional Unit: | Schools > School of Computing |
| Former Institutional Unit: |
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: | 20 May 2025 10:07 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/21028 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):

https://orcid.org/0000-0001-5099-9375
Total Views
Total Views