F. Bronsard, T. K. Lakshman, and U. S. Reddy. Directionally Typed Prolog: Unifying notions of Types and Directionality. Technical Report submitted to ICLP '94 and available via anonymous ftp from a.cs.uiuc.edu: in directory pub/reddy/tkl, November 1993.  Home/Search   Document Not in Database   Summary   Related Articles

....the added complication that both terms have multiple conflicting definitions in the literature. To avoid confusion over terminology, we prefer to introduce a fresh and hopefully descriptive name. 1 1 The name directional type has also been adopted by Bronsard et al. in their subsequent work [BLR93] on a polymorphic type system and used for proving termination of logic programs with incomplete data structures. 2 append(nil; Y; Y) append(W:X; Y; W:Z) append(X; Y; Z) a) The append predicate. List (1) List(1) 1) List (1) List (1) List(1) 1; 1; List(1) List (1) List ....

....for terms, upper case for set expressions) It is often useful to lift a ground term substitution to a set substitution. The lift of oe is written oe where oe(ff) foe(ff)g. 4 Types and Well Typing We begin the development with a brief review of definitions of type and well typing from [Apt93, BLR92, BLR93]. These definitions are independent of any particular representation of types. Definition 4.1 A type is a set of terms closed under substitution. Give a term t and type T , we write t : T , read t has type T , if t 2 T . The definition of a well typed program relies on two subsidiary ....

F. Bronsard, T. K. Lakshman, and U. S. Reddy. Directionally Typed Prolog: Unifying notions of Types and Directionality. Technical Report submitted to ICLP '94 and available via anonymous ftp from a.cs.uiuc.edu: in directory pub/reddy/tkl, November 1993.

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