Pages that link to "Item:Q4939694"
From MaRDI portal
The following pages link to Using types as search keys in function libraries (Q4939694):
Displaying 10 items.
- An approach to completing variable names for implicitly typed functional languages (Q526448) (← links)
- Proof-functional connectives and realizability (Q1330311) (← links)
- Semantic distance between specifications (Q1583257) (← links)
- Efficient and flexible matching of recursive types (Q1854490) (← links)
- Second-order type isomorphisms through game semantics (Q2474443) (← links)
- Remarks on isomorphisms in typed lambda calculi with empty and sum types (Q2498898) (← links)
- Computing with Semirings and Weak Rig Groupoids (Q2802473) (← links)
- Retrieving library functions by unifying types modulo linear isomorphism (Q4304554) (← links)
- On the unification problem for Cartesian closed categories (Q4358059) (← links)
- Refining reduction in the lambda calculus (Q4880488) (← links)
