| W. Charatonik. Directional type checking for logic programs: Beyond discriminative types. In Proceedings of the European Symposium on Programming, LNCS 1782, pages 7287. Springer Verlag, 2000. |
....which checks whether a program is well typed with respect to a given set of directional types. The complexity of the type veri cation and inference in the Aiken Lakshman system was studied by Charatonik and Podelski [7] who gave an algorithm for the inferring directional types. Charatonik [6] showed that directional type checking is EXPTIME complete. Types in the Aiken Lakshman system are not polymorphic. J. Boye and J. Mauszyski in [3, 4] designed a system where directional types are merged with polymorphic types of terms. In our type system input and output types are not regular ....
W. Charatonik. Directional type checking for logic programs: Beyond discriminative types. In Proceedings of the European Symposium on Programming, LNCS 1782, pages 7287. Springer Verlag, 2000.
....for combining types) Prescriptive and descriptive approaches. There are two main streams in the research on types in logic programming. In the prescriptive stream the user has to provide type declarations for predicates; these declarations form an This is an extended and revised version of [19, 13] integral part of the program. The system then checks if the program is welltyped, that is, if the type declarations are consistent. This approach can be found in particular in [46, 34, 42, 56, 44, 1] In the descriptive stream the types are inferred by the system and used to describe semantic ....
W. Charatonik. Directional type checking for logic programs: Beyond discriminative types. In G. Smolka, editor, Proceedings of the 8th European Symposium on Programming ESOP'00, volume 1782 of Lecture Notes in Computer Science, pages 72-87, Berlin, Germany, March 2000. Springer.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC