The following pages link to Provable isomorphisms of types (Q4017461):
Displaying 23 items.
- Genetic programming \(+\) proof search \(=\) automatic improvement (Q682376) (← links)
- Proof-functional connectives and realizability (Q1330311) (← links)
- A coinductive completeness proof for the equivalence of recursive types (Q1607224) (← links)
- Efficient and flexible matching of recursive types (Q1854490) (← links)
- Functional pearl: the distributive \(\lambda\)-calculus (Q2039932) (← links)
- Remarks on isomorphisms in typed lambda calculi with empty and sum types (Q2498898) (← links)
- Isomorphisms of types in the presence of higher-order references (Q2904625) (← links)
- Automorphisms of types in certain type theories and representation of finite groups (Q3119463) (← links)
- On Isomorphisms of Intersection Types (Q3540197) (← links)
- (Q3752606) (← links)
- Constructively equivalent propositions and isomorphisms of objects, or terms as natural transformations (Q4010353) (← links)
- Cartesian isomorphisms are symmetric monoidal: A justification of linear logic (Q4254631) (← links)
- (Q4282541) (← links)
- Retrieving library functions by unifying types modulo linear isomorphism (Q4304554) (← links)
- On the unification problem for Cartesian closed categories (Q4358059) (← links)
- A confluent reduction for the λ-calculus with surjective pairing and terminal object (Q4895554) (← links)
- Remarks on Isomorphisms of Simple Inductive Types (Q4924549) (← links)
- Procedural isomorphism, analytic information and -conversion by value (Q4925174) (← links)
- (Q5089014) (← links)
- Isomorphism of intersection and union types (Q5268999) (← links)
- (Q5277981) (← links)
- Extensional proofs in a propositional logic modulo isomorphisms (Q6052705) (← links)
- Retrieving library identifiers via equational matching of types (Q6488563) (← links)
