Using types as search keys in function libraries
From MaRDI portal
Publication:4939694
DOI10.1017/S095679680000006XzbMath1155.68452MaRDI QIDQ4939694
Publication date: 9 February 2000
Published in: Journal of Functional Programming (Search for Journal in Brave)
68N18: Functional programming and lambda calculus
68Q55: Semantics in the theory of computing
68Q65: Abstract data types; algebraic specification
Related Items
Retrieving library functions by unifying types modulo linear isomorphism, On the unification problem for Cartesian closed categories, Refining reduction in the lambda calculus, An approach to completing variable names for implicitly typed functional languages, Proof-functional connectives and realizability, Semantic distance between specifications, Efficient and flexible matching of recursive types, Second-order type isomorphisms through game semantics, Remarks on isomorphisms in typed lambda calculi with empty and sum types, Computing with Semirings and Weak Rig Groupoids
Cites Work
- Unification in a combination of arbitrary disjoint equational theories
- Unification theory
- Topoi. The categorial analysis of logic
- Characterization of normal forms possessing inverse in the \(\lambda\)- \(\beta\)-\(\eta\)-calculus
- The category of finite sets and Cartesian closed categories
- Some Application of Nevanlinna Theory to Mathematical Logic: Identities Exponential Functions
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Complete Sets of Reductions for Some Equational Theories
- Determining the Equivalence of Algebraic Expressions by Hash Coding