Using information systems to solve recursive domain equations

This paper aims to make the following main contribution: to show how to use the concrete nature of Scott's information systems to advantage in solving recursive domain equations. The method is based on the substructure relation between information systems. This essentially makes a complete partial order (cpo) of information systems. Standard domain constructions like function space can be made continous on this cpo so the solution of recursive domain equations reduces to the more familiar construction of forming the least fixed-point of a continuous function.

Authors

• Kim Guldstrand Larsen
• Glynn Winskel

Keywords

No keywords are indexed for this paper.