Kahrs, Stefan (2003) Well-Going Programs Can Be Typed. In: Hofmann, Martin, ed. Typed Lambda Calculi and Applications 6th International Conference. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 167-179. ISBN 978-3-540-40332-6. E-ISBN 978-3-540-44904-1. (doi:10.1007/3-540-44904-3_12) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:13967)
The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
Official URL: http://dx.doi.org/10.1007/3-540-44904-3_12 |
Abstract
Our idiomatically objectionable title is a pun on Milner's ``well-typed programs do not go wrong'' --- because we provide a completeness result for type-checking rather than a soundness result. We show that the well-behaved functions of untyped PCF are already expressible in typed PCF: any equivalence class of the partial logical equivalence generated from the flat natural numbers in the model given by PCF's operational semantics is inhabited by a well-typed term.
Item Type: | Book section |
---|---|
DOI/Identification number: | 10.1007/3-540-44904-3_12 |
Additional information: | 6th International Conference on Typed Lambda Calculi and Applications (TLCA 2003) VALENCIA, SPAIN, JUN 10-12, 2003 |
Uncontrolled keywords: | PCF, completeness, full abstraction |
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: | 24 Nov 2008 18:01 UTC |
Last Modified: | 05 Nov 2024 09:47 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/13967 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):