On the building of affine retractions

DOI10.1017/S096012950800683XzbMath1153.68013MaRDI QIDQ3520151

Aleksy Schubert

Publication date: 15 August 2008

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

polynomial algorithmaffine retractability

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Cites Work

• Unnamed Item
• Polymorphic type inference and containment
• Characterization of normal forms possessing inverse in the \(\lambda\)- \(\beta\)-\(\eta\)-calculus
• Efficient and flexible matching of recursive types
• Decidability of bounded second order unification
• Bounded Second-Order Unification Is NP-Complete
• Efficient algorithms for isomorphisms of simple types

This page was built for publication: On the building of affine retractions