A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Most relevant to functional programming is the use of subtypes to provide a basis for the insertion of automatic coercions in languages with ad hoc polymorphism (or overloading). ... Summary: “The notion of subtypes occurs in a variety of different programming languages. ...
The equational theory of intersection types can be presented as an algebraic theory with an ACI (associative, commutative, and idempotent) operator (intersection type) combined with distributivity properties ... We place the algebraic intersection type unification problem in the context of unification theory. ... Typability in systems extending simple types with subtyping can be characterized by the problem of subtype satisfiability [Reh98] . ...arXiv:1611.05672v4 fatcat:73a53mg7unda3lecqrf34hs64q
In particular, IISUP, the full subcategory of BC with all prime-algebraic lattices as objects, is such a categorical semantics. ... Given PRIME, the full subcategory of BC with prime-algebraic dcpo’s as objects, we introduce a prime-algebraic quotient IIA which preserves all the logical operations in SUP up to isomorphism. ...
This is followed by a reduction of typability in Leivant’s system with subsumption to subsumption itself.” ... Third, for the sake of flexibility, a subtyping relation is considered on the type and effect algebras. This relation allows us to infer much more precise type and effect information. ...
Programming 23 (1994), no. 2-3, 197-226; MR 95m:68113] has proposed an elegant exten- sion of the ML type system for polymorphic functional languages with overloading. ... We prove that any A-term typable in this system is strongly normal- izing, which solves an open problem of Thatte. We also prove that the fragment without | types has strictly fewer terms. ...
Lecture Notes in Computer Science
This paper studies the complexity of type inference in -calculus with subtyping. Type inference is equivalent to solving systems of subtype inequalities. ... We consider simple types ordered structurally from an arbitrary set of base subtype assumptions. In this case, we give a PSPACE upper bound. ... In this case uniform-ssi is actually equivalent to uni cation. This is why simple types with structural subtyping constitute a natural extension of ML. ...doi:10.1007/bfb0032747 fatcat:aiquebdcorex3ea5cpofu2vqd4
Using the proof assistant Isabelle/HOL, we have machine-checked a recent work of Boudol and Castellani  , which defines an information flow type system for a concurrent language with scheduling, and ... Information flow type systems provide an elegant means to enforce confidentiality of programs. ... They also include the subtyping relations in the premises. ...doi:10.1145/1029133.1029136 dblp:conf/ccs/BartheN04 fatcat:wnwnals7fbekligzsfn5n3jlrm
algebraic characterization of typability in ML with subtyping (104-119); Chiara Bodei, Pier- paolo Degano, Flemming Nielson and Hanne Riis Nielson, Static analysis of processes for no read-up and no write-down ... , Ex- act and efficient computation of the expected number of missing and common words in random texts (375-387); Mireille Régnier and Laurent Mouchard, Periods and quasiperiods characterization (388-396 ...
Lecture Notes in Computer Science
We present an extension of a statically typed language with a special type dyn and explicit type tagging and checking operations (coercions). ... If the meaning of an incomplete program is to be the meaning of any of its completions and if it is too be unambiguous it is necessary that all its completions are coherent (semantically equivalent). ... I am especially greatful for his inquisitive questions that led to the definition of safety. I am also grateful for helpful discussions with members of the TOPPS group at DIKU. ...doi:10.1007/3-540-55253-7_14 fatcat:rpbizuxjrvhstcagapgtehwns4
AbstractSubtyping appears in a variety of programming languages, in the form of the 'automatic coercion' of integers to reals, Pascal subranges, and subtypes arising from class hierarchies in languages ... An algorithm G for computing the most general typing associated with any given expression, and a restricted, optimized algorithm GA using only atomic subtyping hypotheses are developed. ... Acknowledgements: Thanks to Ravi Sethi for originally suggesting the study of type inference with coercions and to Lalita Jategaonkar for manyhelpful suggestions. ...doi:10.1017/s0956796800000113 fatcat:zgib5hgfizf5rmugz7ndnnsjnm
We propose a system of graphic (type) constraints that can be used to perform type inference in both ML or ML F . ... ML F is a type system that seamlessly merges ML-style type inference with System-F polymorphism. ... Acknowledgments We would like to thank Didier Le Botlan and Yann Régis-Gianas for numerous helpful suggestions on previous versions of this work. ...doi:10.1145/1411203.1411216 fatcat:auekis6qnfamzhpnx6curkrakq
We propose a system of graphic (type) constraints that can be used to perform type inference in both ML or ML F . ... ML F is a type system that seamlessly merges ML-style type inference with System-F polymorphism. ... Acknowledgments We would like to thank Didier Le Botlan and Yann Régis-Gianas for numerous helpful suggestions on previous versions of this work. ...doi:10.1145/1411204.1411216 dblp:conf/icfp/RemyY08 fatcat:ghspgii22zfjbhunk4gvg3k72i
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically expanded or translated ... We present here a complementary, operational view of monadic effects, in which an effect definition directly induces an imperative behavior of the new operations expressible in the monad. ... In ML-like languages, one can of course use such an approach as well, but it seems less natural. ...doi:10.1145/1706299.1706354 dblp:conf/popl/Filinski10 fatcat:eofxuwe3rjho3pbhvytb6ouljy
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically expanded or translated ... We present here a complementary, operational view of monadic effects, in which an effect definition directly induces an imperative behavior of the new operations expressible in the monad. ... In ML-like languages, one can of course use such an approach as well, but it seems less natural. ...doi:10.1145/1707801.1706354 fatcat:u5spusw2rffspcmx2bdwpwzeca
« Previous Showing results 1 — 15 out of 97 results