Computer Science – Logic in Computer Science
Scientific paper
2002-12-05
Computer Science
Logic in Computer Science
First International Workshop on Isomorphisms of Types Toulouse, France, 8-9 november 2002
Scientific paper
We define a sound and complete proof system for affine beta-eta-retractions
in simple types built over many atoms, and we state simple necessary conditions
for arbitrary beta-eta-retractions in simple and polymorphic types.
Regnier Laurent
Urzyczyn Pawel
No associations
LandOfFree
Retractions of Types with Many Atoms 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 Retractions of Types with Many Atoms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Retractions of Types with Many Atoms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-702828