| M.J. Plasmeijer and M.C.J.D. van Eekelen. Language report concurrent clean. Technical Report CSI-R9816, Computing Science Institute, University of Nijmegen, Nijmegen, The Netherlands, June 1998. |
....Our intention is to state that for any instance type S of the Sequence class there must be an instance for Eq (S T) whenever there is an instance Eq T for some type T. To our knowledge such a property can t be expressed by any type class system to date. Stuckey and Sulzmann introduce in [21] a general overloading framework based on Constraint Handling Rules (CHRs) Essential algorithms such as type inference and unambiguity checks can be performed by running the underlying CHR evaluation engine. The system is user programmable in the sense that the user is able to state additional ....
....(simplify) i.e. add (replace) the right hand side. Type inference is decidable if the CHRs are terminating, i.e. any constraint set can be reduced in a finite number of steps such that no further CHRs are applicable. For a detailed exposition on type inference and related issues we refer to [21]. Here, we give a short overview of some of the important criterias which need to be satisfied by a Chameleon program. 2.1 Termination The program theory must be terminating. Example 2. Consider the following program fragment: overload eq : Eq ( a] a] Bool) a a Bool eq x y = eq [x] ....
[Article contains additional citation context not shown here]
M.J. Plasmeijer and M.C.J.D. van Eekelen. Language report Concurrent Clean. Technical Report CSI-R9816, Computing Science Institute, University of Nijmegen, Nijmegen, The Netherlands, June 1998. ftp://ftp.cs.kun.nl/pub/Clean/Clean13/doc/refman13.ps.gz.
No context found.
M.J. Plasmeijer, M.C.J.D. van Eekelen (2001), Language Report Concurrent Clean, Version 2.0 (Draft) Faculty of mathematics and Informatics, University of Nijmegen, December 2001. Also available at www.cs.kun.nl/ clean/Manuals/manuals.html
No context found.
R. Plasmeijer, M.C.J.D. van Eekelen (2001), Language Report Concurrent Clean, Version 2.0 (Draft) Faculty of mathematics and Informatics, University of Nijmegen, December 2001. Also available at www.cs.kun.nl/ clean/Manuals/manuals.html
No context found.
M.J. Plasmeijer and M.C.J.D. van Eekelen. Language report concurrent clean. Technical Report CSI-R9816, Computing Science Institute, University of Nijmegen, Nijmegen, The Netherlands, June 1998.
No context found.
M.J. Plasmeijer and M.C.J.D. van Eekelen. Language report Concurrent Clean. Tech. Report CSI-R9816, University of Nijmegen, June 1998. ftp://ftp.cs.kun.nl/pub/Clean/Clean13/doc/refman13.ps.gz.
No context found.
M.J. Plasmeijer and M.C.J.D. van Eekelen. Language report concurrent Clean. Technical Report CSI-R9816, Computing Science Institute, University of Nijmegen, Nijmegen, The Netherlands, June 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC