Lu, L. and King, A. (2002) Backward Type Inference Generalises Type Checking. In: Hermenegildo, M. and Puebla, G., eds. Static Analysis. Lecture Notes in Computer Science, 2477. Springer-Verlag, Berlin pp. 85-101. ISBN 978-3-540-44235-6.
| Postscript | ||
|
Download (1722Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_postscript.png)
|
|
|
Download (501Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
|
|
| Official URL http://dx.doi.org/10.1007/3-540-45789-5_9 |
||
Abstract
This paper presents a backward type analysis for logic programs. Given type signatures for a collection of selected predicates such as builtin or library predicates, the analysis infers type signatures for other predicates such that the execution of any query satisfying the inferred type signatures will not violate the type signatures for the selected predicates. Thus, the backward type analysis generalises type checking in which the programmer manually specifies type signatures for all predicates that are checked for consistency by a type checker.
| Item Type: | Conference or workshop item (Paper) |
|---|---|
| Additional information: | Also see http://www.springer.de/comp/lncs/index.html |
| Uncontrolled keywords: | abstract interpretation, type inference |
| 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: | 24 Nov 2008 17:59 |
| Last Modified: | 06 Sep 2011 01:15 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/13743 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
