Computer Science – Logic in Computer Science
Scientific paper
2007-02-05
Computer Science
Logic in Computer Science
84 pages
Scientific paper
The intrinsic treatment of binding in the lambda calculus makes it an ideal data structure for representing syntactic objects with binding such as formulas, proofs, types, and programs. Supporting such a data structure in an implementation is made difficult by the complexity of the substitution operation relative to lambda terms. In this paper we present the suspension calculus, an explicit treatment of meta level binding in the lambda calculus. We prove properties of this calculus which make it a suitable replacement for the lambda calculus in implementation. Finally, we compare the suspension calculus with other explicit treatments of substitution.
No associations
LandOfFree
The Suspension Calculus and its Relationship to Other Explicit Treatments of Substitution in Lambda Calculi 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 The Suspension Calculus and its Relationship to Other Explicit Treatments of Substitution in Lambda Calculi, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Suspension Calculus and its Relationship to Other Explicit Treatments of Substitution in Lambda Calculi will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-714235