abstract ;;Quote: used comprehension syntax and functional programming for the Kleisli data integration system; handles all popular bioinformatics systems

2 ;;Quote: define object types by arbitrarily nested records (f:t), sets {t}, bags {|t|}, lists [t], and variants ; natural mappings for bioinformatics databases

3 ;;Quote: a value is in first normal form if it is "flat"; i.e., no nested records, sets, or bulk types; allows guaranteed termination of deductive queries

3 ;;Quote: in database query languages, queries produce new, implicit types; in functional programming every type is explicit

3 ;;Quote: database types must be completely, conveniently, and anonymously defined by their structure

3 ;;Quote: comprehension syntax creates sets from generators and filters; e.g., Miranda and Wadler's formalization

4 ;;Quote: CPL includes named sub-queries; e.g., organism names

4+;;Quote: in CPL, convert a set into a sorted list

4 ;;Quote: databases require efficient queries and joins; no worse than O(n log n)

4 ;;Quote: Kleisli uses the nested relational calculus (NRC); lambda calculus plus records, and sets

4+;;Quote: nested relational calculus decomposes sets using a restricted form of structural recursion

4 ;;Quote: Kleisli extends NRC with equality, rationals, arithmetic; some power as SQL

4+;;Quote: neither SQL nor NRC can test if an unordered graph is a chain, along with other properties of unordered graphs

5 ;;Quote: Kleisli and its self-describing data exchange use parametric polymorphism and type inference; from functional programming

5 ;;Quote: polymorphic records and variants allow functions that depend on field names alone; implicit typing

5 ;;Quote: all types may be inferred in CPL; allows any data source to be used as long as the inferred type and actual structure are compatible

5 ;;Quote: Kleisli's data exchange format is CPL values; self-describing, e.g., {| indicates a bag; no fixed schema or type declaration

6 ;;Quote: the ext combinator is a universal construct for comprehensions and NRC; restricted form of structural recursion

7 ;;Quote: optimization rule for vertical loop fusion in Kleisli

7 ;;Quote: Kleisli optimizations include code motion, parallelism, laziness, server migration

7+;;Quote: Kleisli optimizer phases defined by a rule-base and application strategy; e.g., BottomUpOnce, TopDownOnce, MaxOnce