Map
Index
Random
Help
th

QuoteRef: wongL9_2000

topics > all references > ThesaHelp: references t-z



ThesaHelp:
references t-z
ThesaHelp:
ACM references m-z
Topic:
functional programming
Topic:
uniform reference to data
Topic:
syntax analysis
Topic:
set-oriented languages
Topic:
type algebras, typed lambda calculus, and type-complete languages
Group:
derived data types
Topic:
uniform data model
Topic:
database schema
Topic:
database queries, joins, and relational algebra
Topic:
structural equivalence vs. name equivalence of data types
Topic:
set construction
Topic:
set operations
Group:
sets
Topic:
generic operations and polymorphism
Topic:
translation of data
Topic:
data record
Topic:
interface type
Topic:
function signature
Topic:
universal data type
Topic:
constants
Topic:
curried functions
Topic:
code optimization by global analysis

Reference

Wong, L, "The functional guts of the Kleisli query system", Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP'00), September 2000, Montreal, Canada, ACM SIGPLAN, 35, 9, pp. 1-10. Google

Other Reference

Wong, L., Kleisli, a functional query system, Journal of Functional Programming, 10.1:19-56, 2000. [full version]

Quotations
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

Related Topics up

ThesaHelp: references t-z (309 items)
ThesaHelp: ACM references m-z (280 items)
Topic: functional programming (45 items)
Topic: uniform reference to data (34 items)
Topic: syntax analysis (29 items)
Topic: set-oriented languages (20 items)
Topic: type algebras, typed lambda calculus, and type-complete languages (28 items)
Group: derived data types   (9 topics, 119 quotes)
Topic: uniform data model (19 items)
Topic: database schema (29 items)
Topic: database queries, joins, and relational algebra (34 items)
Topic: structural equivalence vs. name equivalence of data types (30 items)
Topic: set construction (20 items)
Topic: set operations (12 items)
Group: sets   (7 topics, 148 quotes)
Topic: generic operations and polymorphism (67 items)
Topic: translation of data (26 items)
Topic: data record (57 items)
Topic: interface type (50 items)
Topic: function signature (21 items)
Topic: universal data type (18 items)
Topic: constants (21 items)
Topic: curried functions (14 items)
Topic: code optimization by global analysis (24 items)

Collected barberCB 11/00
Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.