Retrieving library functions by unifying types modulo linear isomorphism

DOI10.1051/ita/1993270605231zbMath0809.68063OpenAlexW136786770MaRDI QIDQ4304554

Mikael Rittri

Publication date: 12 September 1994

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92464

zbMATH Keywords

Cartesian closed categorysymmetric monoidal closed categoryretrieval systems

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (6)

On the unification problem for Cartesian closed categories ⋮ An algebraic theory for web service contracts ⋮ Remarks on isomorphisms in typed lambda calculi with empty and sum types ⋮ Contract-based discovery of Web services modulo simple orchestrators ⋮ Automorphisms of types and their applications ⋮ Efficient and flexible matching of recursive types

Uses Software

• Fudgets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• The linear abstract machine
• Unification theory
• Provable isomorphisms of types
• On the unification problem for Cartesian closed categories
• Using types as search keys in function libraries

This page was built for publication: Retrieving library functions by unifying types modulo linear isomorphism