Efficient algorithms for isomorphisms of simple types

DOI10.1145/604131.604146zbMath1321.68162OpenAlexW2003399024MaRDI QIDQ5892119

Joseph (Yossi) Gil, Jeffrey Considine, Yoav Zibin

Publication date: 11 September 2015

Published in: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/604131.604146

zbMATH Keywords

linear isomorphismsimple typesfirst-order isomorphismnon-recursive typestype signature

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Functional programming and lambda calculus (68N18)

Related Items (2)

On the building of affine retractions ⋮ Generic top-down discrimination for sorting and partitioning in linear time

Uses Software

• TREX

Cites Work

• Regular expression pattern matching for XML
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient algorithms for isomorphisms of simple types