Go backward to 3 Total recursive functions through termination proofs
Go up to Top
Go forward to References
4 Conclusion
We have shown the rather obvious connection of two sublanguages of CASL
(one for partial, one for total recursive functions) to a subset
of any popular functional
programming language. This can serve as a basis for
transformations from CASL to functional programming
languages. Of course, this is only a first step
in solving the problem of the relation
of a full (functional or imperative) programming language to (full) CASL.
Acknowledgements
I wish to thank Bernd Krieg-Brückner and Burkhardt Wolff for
clarifying discussions.
CoFI
Note: L-9 --Version 1.0-- 21 March 1998.
Comments to till@informatik.uni-bremen.de