About classical logic and imperative programming


We consider a λ-calculus system in second-orderclassical logic, in which execution of λ-terms is weak head reduction (call-by-name). By means of some simple examples, we show how it can modelize some aspects of imperative programming languages, such as assignment and escape instructions. A crucial tool is the notion ofstorage operator, for which a simple type is given.

DOI: 10.1007/BF02127805

Cite this paper

@article{Krivine1996AboutCL, title={About classical logic and imperative programming}, author={Jean-Louis Krivine}, journal={Annals of Mathematics and Artificial Intelligence}, year={1996}, volume={16}, pages={405-414} }