This paper presents a system that derives affine retractability for simple types. It also studies the complexity of constructing these affine retractions. The ...

A simple type σ is retractable to a simple type τ if there are two terms Cσ→τ and Dτ→σ such that D ◦ C =βη λx.x. The retractability of types is affine if ...

Sep 9, 2004 · The paper presents a system which for given σ,τ derives affine retractability i.e. the above relation with additional restriction that in C and ...

This paper presents a system that derives affine retractability for simple types. It also studies the complexity of constructing these affine retractions. The ...

This paper presents a system that derives affine retractedability for simple types and studies the complexity of constructing these affine retractions, ...

Request PDF | On Jan 1, 2008, Aleksy Schubert published On the building of affine retractions. | Find, read and cite all the research you need on ResearchGate.

This paper presents a system that derives affine retractability for simple types. It also studies the complexity of constructing these affine retractions. The ...

The paper presents a system which for given σ,τ derives affine retractability i.e. the above relation with additional restriction that in C and D every bound ...

Discover this 2008 paper in Mathematical Structures in Computer Science by ALEKSY SCHUBERT focusing on: ALGORITHMS; POLYNOMIALS; MATHEMATICAL functions; ...

This paper presents a system for inferring affine retractability together with the accompanying terms. C and D. There are two reasons that justify the ...