Functions as proofs as processes

Details Functions as proofs as processes Functions as proofs as processes

2011-07-21

arxiv.org/abs/1107.4160v1

Computer Science

Logic in Computer Science

Scientific paper

This paper presents a logical approach to the translation of functional calculi into concurrent process calculi. The starting point is a type system for the {\pi}-calculus closely related to linear logic. Decompositions of intuitionistic and classical logics into this system provide type-preserving translations of the \lambda- and \lambda\mu-calculus, both for call-by-name and call-by-value evaluation strategies. Previously known encodings of the \lam-calculus are shown to correspond to particular cases of this logical embedding. The realisability interpretation of types in the \pi-calculus provides systematic soundness arguments for these translations and allows for the definition of type-safe extensions of functional calculi.

Affiliated with

Also associated with

No associations

Rating

Functions as proofs as processes 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 Functions as proofs as processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Functions as proofs as processes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-687455