Provable isomorphisms and domain equations in models of typed languages
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Theoretical Computer Science
Views: a way for pattern matching to cohabit with data abstraction
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Polymorphic type inference and containment
Information and Computation - Semantics of Data Types
ACM Transactions on Programming Languages and Systems (TOPLAS)
Signature matching: a key to reuse
SIGSOFT '93 Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering
Automated synthesis of interface adapters for reusable classes
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Polytypic data conversion programs
Science of Computer Programming
How to repair type errors automatically
Trends in functional programming
A Complete Axiom System for Isomorphism of Types in Closed Categories
LPAR '93 Proceedings of the 4th International Conference on Logic Programming and Automated Reasoning
Type Isomorphisms for Module Signatures
PLILP '96 Proceedings of the 8th International Symposium on Programming Languages: Implementations, Logics, and Programs
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Advanced Functional Programming, Second International School-Tutorial Text
Retrieving Library Identifiers via Equational Matching of Types
Proceedings of the 10th International Conference on Automated Deduction
A Deciding Algorithm for Linear Isomorphism of Types with Complexity O (n log2(n))
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
Syntactic Considerations on Recursive Types
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Efficient and Flexible Matching of Recursive Types
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Isomorphisms of generic recursive polynomial types
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Isomorphic objects in symmetric monoidal closed categories
Mathematical Structures in Computer Science
Subtyping recursive types modulo associative commutative products
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Tips on teaching types and functions
Proceedings of the 2008 international workshop on Functional and declarative programming in education
On Isomorphisms of Intersection Types
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
On isomorphisms of intersection types
ACM Transactions on Computational Logic (TOCL)
Proceedings of the 6th ACM SIGPLAN workshop on Generic programming
Linear logical relations for session-based concurrency
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Journal of Logic, Language and Information
| Hi-index | 0.00 |
We were all taught in high school that two objects $A$ and $B$ are isomorphic iff there exist two functions $f$ and $g$ such that