A feasible algorithm for typing in Elementary Affine Logic

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

20 pages

Scientific paper

We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following previous references on this topic, the variant of EAL type system we consider (denoted EAL*) is a variant without sharing and without polymorphism. Our algorithm improves over the ones already known in that it offers a better complexity bound: if a simple type derivation for the term t is given our algorithm performs EAL* type inference in polynomial time.

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

A feasible algorithm for typing in Elementary Affine Logic 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 A feasible algorithm for typing in Elementary Affine Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A feasible algorithm for typing in Elementary Affine Logic will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-169637

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