Polymorphic algebraic data type reconstruction Export

@inproceedings{citeulike:3211379, abstract = {One of the disadvantages of statically typed languages is the programming overhead caused by writing all the necessary type information: Both type declarations and type definitions are typically required. Traditional type inference aims at relieving the programmer from the former.We present a rule-based constraint rewriting algorithm that reconstructs both type declarations and type definitions, allowing the programmer to effectively program type-less in a strictly typed language. This effectively combines strong points of dynamically typed languages (rapid prototyping) and statically typed ones (documentation, optimized compilation). Moreover it allows to quickly port code from a statically untyped to a statically typed setting.Our constraint-based algorithm reconstructs uniform polymorphic definitions of algebraic data types and simultaneously infers the types of all expressions and functions (supporting polymorphic recursion) in the program. The declarative nature of the algorithm allows us to easily show that it has a number of highly desirable properties such as soundness, completeness and various optimality properties. Moreover, we show how to easily extend and adapt it to suit a number of different language constructs and type system features}, address = {New York, NY, USA}, author = {Schrijvers, Tom and Bruynooghe, Maurice}, booktitle = {PPDP '06: Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming}, citeulike-article-id = {3211379}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1140347}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1140335.1140347}, citeulike-linkout-2 = {http://www.cs.kuleuven.be/~dtai/publications/files/42191.pdf}, doi = {10.1145/1140335.1140347}, isbn = {1-59593-388-3}, keywords = {algebraic-data-types, constraint-satisfaction, type-inference}, location = {Venice, Italy}, pages = {85--96}, posted-at = {2008-09-12 04:34:05}, priority = {0}, publisher = {ACM}, title = {Polymorphic algebraic data type reconstruction}, url = {http://dx.doi.org/10.1145/1140335.1140347}, year = {2006} }

TY - CONF ID - citeulike:3211379 L3 - citeulike-article-id:3211379 N2 - One of the disadvantages of statically typed languages is the programming overhead caused by writing all the necessary type information: Both type declarations and type definitions are typically required. Traditional type inference aims at relieving the programmer from the former.We present a rule-based constraint rewriting algorithm that reconstructs both type declarations and type definitions, allowing the programmer to effectively program type-less in a strictly typed language. This effectively combines strong points of dynamically typed languages (rapid prototyping) and statically typed ones (documentation, optimized compilation). Moreover it allows to quickly port code from a statically untyped to a statically typed setting.Our constraint-based algorithm reconstructs uniform polymorphic definitions of algebraic data types and simultaneously infers the types of all expressions and functions (supporting polymorphic recursion) in the program. The declarative nature of the algorithm allows us to easily show that it has a number of highly desirable properties such as soundness, completeness and various optimality properties. Moreover, we show how to easily extend and adapt it to suit a number of different language constructs and type system features CY - Venice, Italy SN - 1-59593-388-3 AD - New York, NY, USA EP - 96 TI - Polymorphic algebraic data type reconstruction PB - ACM T2 - PPDP '06: Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming SP - 85 KW - algebraic-data-types KW - constraint-satisfaction KW - type-inference AU - Schrijvers, Tom AU - Bruynooghe, Maurice PY - 2006/// UR - http://dx.doi.org/10.1145/1140335.1140347 ER -