Typage fort et typage souple des collections topologiques et des transformations

Computer Science – Programming Languages

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Topological collections allow to consider uniformly many data structures in programming languages and are handled by functions defined by pattern matching called transformations. We present two type systems for languages with topological collections and transformations. The first one is a strong type system \`a la Hindley/Milner which can be entirely typed at compile time. The second one is a mixed static and dynamic type system allowing to handle heterogeneous collections, that is collections which contain values with different types. In the two cases, automatic type inference is possible.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Typage fort et typage souple des collections topologiques et des transformations 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 Typage fort et typage souple des collections topologiques et des transformations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Typage fort et typage souple des collections topologiques et des transformations will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-555941

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.