Loading...
Please wait, while we are loading the content...
Similar Documents
Typing rule-based transformations over topological collections (2003).
| Content Provider | CiteSeerX |
|---|---|
| Author | Cohen, Julien |
| Abstract | 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 [9] 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. |
| File Format | |
| Publisher Date | 2003-01-01 |
| Access Restriction | Open |
| Subject Keyword | Topological Collection Rule-based Transformation Functional Language Polytypic Extension Case-based Function Definition Programming Style Typed Discipline Type Inference Rule-based Programming Style Rule-based Definition General Data Structure |
| Content Type | Text |
| Resource Type | Article |
