Computer Science – Logic in Computer Science
Scientific paper
2010-09-14
EPTCS 34, 2010, pp. 101-116
Computer Science
Logic in Computer Science
In Proceedings LFMTP 2010, arXiv:1009.2189
Scientific paper
10.4204/EPTCS.34.9
We define the pattern fragment for higher-order unification problems in
linear and affine type theory and give a deterministic unification algorithm
that computes most general unifiers.
Schack-Nielsen Anders
Schürmann Carsten
No associations
LandOfFree
Pattern Unification for the Lambda Calculus with Linear and Affine Types 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 Pattern Unification for the Lambda Calculus with Linear and Affine Types, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pattern Unification for the Lambda Calculus with Linear and Affine Types will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-76528