Mark P. Jones. A theory of quali ed types. In European Symposium on Programming, volume 582 of Lecture Notes in Computer Science, pages 287-306. Springer Verlag, February 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... parameters of those fully polymorphic functions may themselves be fully polymorphic functions, ad in nitum) Various calculi which model the type systems of object oriented programming languages have been studied in great detail [21, 85] Various other language extensions such as type classes [27, 43, 47, 75, 82] and existential types [51] have also traditionally been formulated in a form of calculus. Given the connection between functional programming and calculus, it is not surprising that modern functional programming languages typically have much richer type systems than other programming ....

Mark P. Jones. A theory of quali ed types. In European Symposium on Programming, volume 582 of Lecture Notes in Computer Science, pages 287-306. Springer Verlag, February 1992.

....type of the form 8a:Ca ) a b. Interpret this as: for all types a which meet the constraint Accomplishments and Research Challenges in Meta Programming 33 Ca, the function f has type a b. The constraint quali es the quanti cation. Such types are used in the type class system of Haskell [40, 41]. A simliar mechanism can be used to track dependencies on indexes. For example, consider an alternative to the eval function above, which rather than returning another kind of object term like Value, returns an actual tuple. Note the quali ed type of eval2 below: eval2 : Encodes a b = Exp a ....

....Prolog like de nition. The constraint Encodes a b can be used to track the type dependency of the result of eval2 on its input. Tracking dependencies. There is a well understood theory of constraint propogation and management that can be brought to bear on meta programs such as eval2 above [40, 41]. Consider a de ntion of a function f. f x y = eval2 x y In a constrained type system, the constraint Encodes a b in the type of eval2 is propagated by type inference into the type of f, which can be given by f : Encodes a Int = Exp a Int Int Further more, using the Prolog like rules ....

M. P. Jones. A theory of qualied types. In B. Krieg-Bruckner, editor, ESOP '92, 4th European Symposium on Programming, Rennes, France, February 1992, Proceedings, volume 582 of Lecture Notes in Computer Science, pages 287-306. Springer-Verlag, New York, NY, 1992.

.... the inference of the data type declarations is in uenced by Mishra and Reddy s work of Declaration free Type Checking [12] and Wright and Cartwright s work of soft type system for Scheme [13] Also, there is a similaritybetween the typing of the core language and the typing of quali ed types [14]. However, the work developed in this paper is essentially different from all these works. Grammar types o ers a better way of doing modular programming. It is more intuitive to understand and easier to apply. Also, there are twonovelties in this approach. First, it provides the inference of data ....

Mark P. Jones. A Theory of Qualied Types. In ######## ######### ## ###########,volume 582 of ####. Springer Verlag, 1992.

....us to represent various polymorphic primitives. It enables us to keep track of the set of type variables used in typing derivations. This will become crucial when we perform type directed specialization. This mechanism was rst introduced in [30] for compiling record polymorphism. Jones [16] proposed a similar mechanism of quanti ed types for compiling type classes. Required kinds depend on the form of polymorphism we would like to support. Instead of assuming some particular kinds, we consider the source language ml as a family of languages 5 parameterized by a kind ....

M. Jones. A theory of qualied types. In Proc. ESOP Symposium, 1992.

....ways, they cannot encode denials , which would be required in the present case. However, this kind of negative information is required in type systems for records, which need to express the absence of a particular label [24, 30] Similar information can also be expressed using quali ed types [10]. Progressing from HTML to XML [2] would also solve the problem because XML does not support exceptions, anymore. 5.4 Assessment We found the library surprisingly easy and intuitive to use. Especially, programming HTML in container passing style results in a fairly natural syntax. The ....

Mark P. Jones. A theory of qualied types. In Bernd Krieg-Bruckner, editor, Proc. 4th European Symposium on Programming '92, volume 582 of Lecture Notes in Computer Science, pages 287-306, Rennes, France, February 1992. SpringerVerlag.

....shapely over lists provide an even better alternative. 5 2. 2 Monads The versatility and usefulness of monadic programming has been demonstrated by several researchers, and this has led the Haskell language designers to support this programming style by introducing suitable quali ed kinds (see [8]) It is important to keep a clear distinction between computational monads and datatypes. Computational monads are mainly for structuring control, while the main purpose of datatypes is for structuring data. We write Monad for the category of monads T on Set and monad morphisms. There are two ....

Mark P. Jones. A theory of qualied types. In ESOP'92, LNCS 582. Springer Verlag, 1992.

....these goals calls for more research into the theoretical foundations of program analysis as well as their algorithmic (or even decidability) properties. One of the approaches to program analysis is that of annotated type and e ect systems: it requires that a typed programming language be given [76, 45]. The type system is then modi ed with additional annotations (called e ects) that expose further intensional or extensional properties of the semantics of the programs. The literature has seen a great variation in the annotations and e ects used. Example e ects are: collecting the set of ....

M. P. Jones. A theory of qualied types. In Proc. ESOP '92, pages 287-306, Springer Lecture Notes in Computer Science 582, 1992.

....language. These rules are supplied by the user and may be nearly arbitrary (see Section 2.4) For example, a rule for const adds a quali er test to require that the lefthand side of an assignment is non const. An example of a 2 Apologies to Mark P. Jones for overloading the term quali ed types [Jon92] well formedness condition comes from binding time analysis: Nothing dynamic may appear within a value that is static. Thus, a type such as static (dynamic dynamic ) is not well formed. 3 Because our framework is parameterized by the set of quali ers, we must extend not only the types, ....

Mark P. Jones. A theory of qualied types. In Bernd Krieg-Brucker, editor, 4th European Symposium on Programming, number 582 in Lecture Notes in Computer Science, pages 287-306, Rennes, France, February 1992. Springer-Verlag.

....of Haskell in the presence of our proposed extensions, as this would unnecessarily complicate the language, and duplicate functionality. Firm theoretical foundations for our system are provided by the earlier work of Gaster and Jones [GJ96] with a type system based on the theory of quali ed types [Jon92]. This integrates smoothly with the rest of the Haskell type system, and supports lightweight, extensible records with a complement of polymorphic operations for manipulating them. On a more concrete level, our proposal is inspired by practical experience with the Trex implementation ( typed ....

M.P. Jones. A theory of qualied types. In European Symposium on Programming (ESOP'92), number 582 in Lecture Notes in Computer Science, Rennes, France, February 1992. Springer Verlag.

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