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.

Links and resources

Tags