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.
Users
Please
log in to take part in the discussion (add own reviews or comments).