Typing rule-based transformations over topological collections

Details Typing rule-based transformations over topological collections Typing rule-based transformations over topological collections

2009-12-24

arxiv.org/abs/0912.4877v1

4th International Workshop on Rule-Based Programming, Valencia : Spain (2003)

Computer Science

Programming Languages

Scientific paper

10.1016/S1571-0661(04)80676-5

Pattern-matching programming is an example of a rule-based programming style developed in functional languages. This programming style is intensively used in dialects of ML but is restricted to algebraic data-types. This restriction limits the field of application. However, as shown by Giavitto and Michel at RULE'02, case-based function definitions can be extended to more general data structures called topological collections. We show in this paper that this extension retains the benefits of the typed discipline of the functional languages. More precisely, we show that topological collections and the rule-based definition of functions associated with them fit in a polytypic extension of mini-ML where type inference is still possible.

Affiliated with

Also associated with

No associations

Rating

Typing rule-based transformations over topological collections does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Typing rule-based transformations over topological collections, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Typing rule-based transformations over topological collections will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-555939