Computer Science – Logic in Computer Science
Scientific paper
2012-02-21
Computer Science
Logic in Computer Science
21 pages
Scientific paper
The lambda calculus with constructors is an extension of the lambda calculus with variadic constructors. It decomposes the pattern-matching a la ML into a case analysis on constants and a commutation rule between case and application constructs. Although this commutation rule does not match with the usual computing intuitions, it makes the calculus expressive and confluent, with a rather simple syntax. In this paper we define a sound notion of categorical model for the lambda calculus with constructors. We then prove that this definition is complete for the fragment of the calculus with no match-failure, using the model of partial equivalence relations.
No associations
LandOfFree
A Categorical Model for the Lambda Calculus with Constructors 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 Categorical Model for the Lambda Calculus with Constructors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Categorical Model for the Lambda Calculus with Constructors will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-423798