Elementary affine $lambda$-calculus with multithreading and side effects

Details Elementary affine $lambda$-calculus with multithreading and side effects Elementary affine $lambda$-calculus with multithreading and side effects

2011-02-24

arxiv.org/abs/1102.4971v2

Computer Science

Programming Languages

Scientific paper

Linear logic provides a framework to control the complexity of higher-order functional programs. We present an extension of this framework to programs with multithreading and side effects focusing on the case of elementary time. Our main contributions are as follows. First, we provide a new combinatorial proof of termination in elementary time for the functional case. Second, we develop an extension of the approach to a call-by-value $lambda$-calculus with multithreading and side effects. Third, we introduce an elementary affine type system that guarantees the standard subject reduction and progress properties. Finally, we illustrate the programming of iterative functions with side effects in the presented formalism.

Affiliated with

Also associated with

No associations

Rating

Elementary affine $lambda$-calculus with multithreading and side effects 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 Elementary affine $lambda$-calculus with multithreading and side effects, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Elementary affine $lambda$-calculus with multithreading and side effects will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-86544