Results 1  10
of
989,838
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
The Essence of Principal Typings
 In Proc. 29th Int’l Coll. Automata, Languages, and Programming, volume 2380 of LNCS
, 2002
"... Let S be some type system. A typing in S for a typable term M is the collection of all of the information other than M which appears in the final judgement of a proof derivation showing that M is typable. For example, suppose there is a derivation in S ending with the judgement A M : # meanin ..."
Abstract

Cited by 97 (15 self)
 Add to MetaCart
Let S be some type system. A typing in S for a typable term M is the collection of all of the information other than M which appears in the final judgement of a proof derivation showing that M is typable. For example, suppose there is a derivation in S ending with the judgement A M
Intersection types Principal typings
, 2009
"... λcalculus with nameless dummies λ dB: the λcalculus with de Bruijn indices Syntax of λ dB βreduction in λ dB The restricted intersection type system for λ dB Restricted intersection types in λ dB Typing systems and properties Type inference algorithm Characterisation of principal typings Characte ..."
Abstract
 Add to MetaCart
λcalculus with nameless dummies λ dB: the λcalculus with de Bruijn indices Syntax of λ dB βreduction in λ dB The restricted intersection type system for λ dB Restricted intersection types in λ dB Typing systems and properties Type inference algorithm Characterisation of principal typings
Principal Typing and Mutual Recursion
 INTERNATIONAL WORKSHOP ON FUNCTIONAL AND LOGIC PROGRAMMING (WFLP 2001)
, 2001
"... As pointed out by Damas [Dam84], the DamasMilner system (ML) has principal types, but not principal typings. Damas also defined in his thesis a slightly modified version of ML, that we call ML', which, given a typing context and an expression, derives exactly the same types, and provided an al ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
As pointed out by Damas [Dam84], the DamasMilner system (ML) has principal types, but not principal typings. Damas also defined in his thesis a slightly modified version of ML, that we call ML', which, given a typing context and an expression, derives exactly the same types, and provided
ML Has Principal Typings
, 2005
"... Is there a type system for coreML that, using exactly the same syntax of types of the DamasMilner system, types exactly the same terms of this system, and has principal typings? In this article we answer this question affirmatively. A definition of principal typing is given, capturing the simple i ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Is there a type system for coreML that, using exactly the same syntax of types of the DamasMilner system, types exactly the same terms of this system, and has principal typings? In this article we answer this question affirmatively. A definition of principal typing is given, capturing the simple
The Essence of Principal Typings
"... Abstract. Let S be some type system. A typing in S for a typable term M is the collection of all of the information other than M which appears in the final judgement of a proof derivation showing that M is typable. For example, suppose there is a derivation in S ending with the judgement A M: τ mean ..."
Abstract
 Add to MetaCart
meaning that M has result type τ when assuming the types of free variables are given by A. Then (A, τ) is a typing for M. A principal typing in S for a term M is a typing for M which somehow represents all other possible typings in S for M. It is important not to confuse this with a weaker notion
Haskell and Principal Types
"... ABSTRACT This paper points out two problems which prevent Haskell from having principal types. For each problem, we discuss a program which exhibits it. The first problem has to do with type signatures and class constraints containing both generic and nongeneric type variables. The second problem is ..."
Abstract
 Add to MetaCart
ABSTRACT This paper points out two problems which prevent Haskell from having principal types. For each problem, we discuss a program which exhibits it. The first problem has to do with type signatures and class constraints containing both generic and nongeneric type variables. The second problem
Haskell and Principal Types
, 2003
"... This paper points out two problems which prevent Haskell from having principal types. For each problem, we discuss a program which exhibits it. The first problem has to do with type signatures and class constraints containing both generic and nongeneric type variables. The second problem is caused b ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper points out two problems which prevent Haskell from having principal types. For each problem, we discuss a program which exhibits it. The first problem has to do with type signatures and class constraints containing both generic and nongeneric type variables. The second problem is caused
What Are Principal Typings and What Are They Good For?
, 1995
"... We demonstrate the pragmatic value of the principal typing property, a property more general than ML's principal type property, by studying a type system with principal typings. The type system is based on rank 2 intersection types and is closely related to ML. Its principal typing property ..."
Abstract

Cited by 102 (0 self)
 Add to MetaCart
We demonstrate the pragmatic value of the principal typing property, a property more general than ML's principal type property, by studying a type system with principal typings. The type system is based on rank 2 intersection types and is closely related to ML. Its principal typing
Principal Types for Nominal Theories
"... Abstract. We define rank 1 polymorphic types for nominal rewrite rules and equations. Typing environments type atoms, variables, and function symbols, and since we follow a Currystyle approach there is no need to fully annotate terms with types. Our system has principal types, and we give rule and ..."
Abstract
 Add to MetaCart
Abstract. We define rank 1 polymorphic types for nominal rewrite rules and equations. Typing environments type atoms, variables, and function symbols, and since we follow a Currystyle approach there is no need to fully annotate terms with types. Our system has principal types, and we give rule
Results 1  10
of
989,838