loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Australasian Computer Science Conference
Refining Logic Programs Using Types
Canberra, Australia
January 31-February 03
ISBN: 0-7695-0518-X
ASCII Text
x 
 
Robert Colvin, Ian Hayes, Paul Strooper, "Refining Logic Programs Using Types," Australasian Computer Science Conference, pp. 43, Australasian Computer Science Conference, 2000.
 
 
BibTex
x
 
@article{ 10.1109/ACSC.2000.824379,
author = {Robert Colvin and Ian Hayes and Paul Strooper},
title = {Refining Logic Programs Using Types},
journal ={Australasian Computer Science Conference},
volume = {0},
year = {2000},
isbn = {0-7695-0518-X},
pages = {43},
doi = {http://doi.ieeecomputersociety.org/10.1109/ACSC.2000.824379},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Australasian Computer Science Conference
TI - Refining Logic Programs Using Types
SN - 0-7695-0518-X
SP
EP
A1 - Robert Colvin,
A1 - Ian Hayes,
A1 - Paul Strooper,
PY - 2000
KW - Refinement
KW - logic programming
KW - types
VL - 0
JA - Australasian Computer Science Conference
ER -
 
Robert Colvin, University of Queensland
Ian Hayes, University of Queensland
Paul Strooper, University of Queensland
The logic programming refinement calculus is a method for transforming specifications to executable code, maintaining the correctness of the code with respect to its specification. In this paper we show how types can be handled in the logic programming refinement calculus. Types of variables are necessary for a complete specification of a procedure, and typing information can guide the refinement of a procedure specification to code. As an application of this framework, we show how dynamic type-checks can be formally eliminated from a sample program.
Index Terms:
Refinement, logic programming, types
Citation:
Robert Colvin, Ian Hayes, Paul Strooper, "Refining Logic Programs Using Types," acsc, pp.43, Australasian Computer Science Conference, 2000
Usage of this product signifies your acceptance of the Terms of Use.