Results 1  10
of
2,052,131
Principal typeschemes for functional programs
 In Proceedings 9th ACM Symposium on Principles of Programming Languages
, 1982
"... the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of its publication and date appear, and notice is given ..."
Abstract

Cited by 428 (0 self)
 Add to MetaCart
the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of its publication and date appear, and notice is given
Principal Type Scheme for Session Types
"... Session types as presented in [1] model communication between processes as a structure of dialogues. The dialogues are specified by sequences of types of messages, where each type describes the format and direction of the message. The resulting system imposes a type discipline that guarantees compat ..."
Abstract
 Add to MetaCart
compatibility of interaction patterns between processes of a welltyped program. The system is polymorphic in Curry’s style, but no formal treatment of this aspect has been provided yet. In this paper we present a system assigning type schemes to programs and an algorithm of inference of the principal type
Principal type schemes for modular programs
 In European Symposium on Programming (ESOP
, 2006
"... Abstract. Two of the most prominent features of ML are its expressive module system and its support for DamasMilner type inference. However, while the foundations of both these features have been studied extensively, their interaction has never received a proper typetheoretic treatment. One conseq ..."
Abstract

Cited by 20 (16 self)
 Add to MetaCart
Abstract. Two of the most prominent features of ML are its expressive module system and its support for DamasMilner type inference. However, while the foundations of both these features have been studied extensively, their interaction has never received a proper typetheoretic treatment. One
Principal type schemes for gradual programs
 In Symposium on Principles of Programming Languages, POPL
, 2015
"... Gradual typing is a discipline for integrating dynamic checking into a static type system. Since its introduction in functional languages, it has been adapted to a variety of type systems, including objectoriented, security, and substructural. This work studies its application to implicitly typed ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
programs as Siek and Vachharajani, but has a modular structure amenable to extension. The language admits letpolymorphism, and its dynamics are defined by translation to the Polymorphic Blame Calculus (Ahmed et al. 2009, 2011). The principal types produced by our initial type system mask the distinction
A New Intrinsic Characterization of the Principal Type Schemes
, 1994
"... : The purpose of this article is to establish a new intrinsic characterization of the principal type schemes (or pts's for short) of the approximate normal terms (or approximate normal forms). This is done by defining a correspondance between cutfree proof nets, finormal terms and their pr ..."
Abstract
 Add to MetaCart
: The purpose of this article is to establish a new intrinsic characterization of the principal type schemes (or pts's for short) of the approximate normal terms (or approximate normal forms). This is done by defining a correspondance between cutfree proof nets, finormal terms
Principal type schemes for the strict type assignment system
 Logic and Computation
, 1993
"... We study the strict type assignment system, a restriction of the intersection type discipline [6], and prove that it has the principal type property. We define, for a term, the principal pair (of basis and type). We specify three operations on pairs, and prove that all pairs deducible for can be obt ..."
Abstract

Cited by 37 (21 self)
 Add to MetaCart
We study the strict type assignment system, a restriction of the intersection type discipline [6], and prove that it has the principal type property. We define, for a term, the principal pair (of basis and type). We specify three operations on pairs, and prove that all pairs deducible for can
Principal Type Schemes for Functional Programs with Overloading and Subtyping
 Science of Computer Programming
, 1994
"... We show how the Hindley/Milner polymorphic type system can be extended to incorporate overloading and subtyping. Our approach is to attach constraints to quantified types in order to restrict the allowed instantiations of type variables. We present an algorithm for inferring principal types and ..."
Abstract

Cited by 47 (2 self)
 Add to MetaCart
We show how the Hindley/Milner polymorphic type system can be extended to incorporate overloading and subtyping. Our approach is to attach constraints to quantified types in order to restrict the allowed instantiations of type variables. We present an algorithm for inferring principal types
Principal Typing Schemes in a Polyadic πCalculus
 CONCUR'93, LNCS 715
, 1993
"... The present paper introduces a typing system for a version of Milner's polyadic ß calculus, and a typing inference algorithm linear on the size of the input. The central concept underlying the typing system is the notion of type assignment, where each free name in a term is assigned a type, t ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
, the term itself being given multiple nametype pairs. This observation leads to a clean typing system for Milner's sorting, and induces an efficient algorithm to infer the typing of a term. The typing system enjoys a subjectreduction property and possesses a notion of principal typing scheme
Principal TypingSchemes in a Polyadic πCalculus
 In 4th International Conference on Concurrency Theory, volume 715 of LNCS
, 1992
"... The present report introduces a typing system for a version of Milner's polyadic ßcalculus, and a typing inference algorithm. The central concept underlying the typing system is the notion of type assignment, where each free name in a term is assigned a type, the term itself being given multi ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
multiple nametype pairs. This observation leads to a clean typing system for Milner's sorting, and induces an efficient algorithm to infer the typing of a term. The typing system enjoys a subjectreduction property and possesses a notion of principal typingscheme. Furthermore, the algorithm
The Askeyscheme of hypergeometric orthogonal polynomials and its qanalogue
, 1998
"... We list the socalled Askeyscheme of hypergeometric orthogonal polynomials and we give a q analogue of this scheme containing basic hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation, the second order di#erent ..."
Abstract

Cited by 580 (6 self)
 Add to MetaCart
#erential or di#erence equation, the forward and backward shift operator, the Rodriguestype formula and generating functions of all classes of orthogonal polynomials in this scheme. In chapter 2 we give the limit relations between di#erent classes of orthogonal polynomials listed in the Askeyscheme. In chapter
Results 1  10
of
2,052,131