Automorphisms of types and their applications
From MaRDI portal
Recommendations
Cites work
- A Complete Proof Synthesis Method for the Cube of Type Systems
- An Efficient Unification Algorithm
- An Introduction to Mathematical Cryptography
- Automorphisms of types in certain type theories and representation of finite groups
- Characterization of normal forms possessing inverse in the - --calculus
- Efficient algorithms for isomorphisms of simple types
- Higher-order unification and matching
- scientific article; zbMATH DE number 3137403 (Why is no real title available?)
- scientific article; zbMATH DE number 3877215 (Why is no real title available?)
- scientific article; zbMATH DE number 4164133 (Why is no real title available?)
- scientific article; zbMATH DE number 591911 (Why is no real title available?)
- scientific article; zbMATH DE number 733666 (Why is no real title available?)
- scientific article; zbMATH DE number 783760 (Why is no real title available?)
- scientific article; zbMATH DE number 863496 (Why is no real title available?)
- scientific article; zbMATH DE number 1400718 (Why is no real title available?)
- scientific article; zbMATH DE number 6744295 (Why is no real title available?)
- Nonabelian algebraic topology. Filtered spaces, crossed complexes, cubical homotopy groupoids. With contributions by Christopher D. Wensley and Sergei V. Soloviev
- Retrieving library functions by unifying types modulo linear isomorphism
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The MOR cryptosystem and finite p-groups
Cited in
(4)
This page was built for publication: Automorphisms of types and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2307975)