Two "Functional Programming" Sublanguages of CASL

Till Mossakowski1

21 March 1998

This document is available by FTP in various formats. It was converted to HTML using Hyperlatex 2.2.

Abstract

We define two sublanguages of CASL that can be easily mapped to functional programs. One of them allows to specify arbitrary partial recursive functions, the other one is restricted to total recursive functions.

Contents

  • 1 Introduction
  • 2 Partial recursive functions through free extensions
  • 3 Total recursive functions through termination proofs
  • 4 Conclusion
  • References
  • Footnotes
    • CoFI Note: L-9 --Version 1.0-- 21 March 1998.
    Comments to till@informatik.uni-bremen.de