Results 1  10
of
57,992
The Nature of Statistical Learning Theory
, 1999
"... Statistical learning theory was introduced in the late 1960’s. Until the 1990’s it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990’s new types of learning algorithms (called support vector machines) based on the deve ..."
Abstract

Cited by 13236 (32 self)
 Add to MetaCart
Statistical learning theory was introduced in the late 1960’s. Until the 1990’s it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990’s new types of learning algorithms (called support vector machines) based
Prolog Implementation of Type Inference Algorithms for Mobile Ambients
, 2003
"... The type system for the ambient calculus M [2] is presented in a new form that derives the minimal type of a term in the minimal environment, and is therefore more amenable than the original form to a translation into a type inference algorithm. From the new formulation a Prolog program is der ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The type system for the ambient calculus M [2] is presented in a new form that derives the minimal type of a term in the minimal environment, and is therefore more amenable than the original form to a translation into a type inference algorithm. From the new formulation a Prolog program
A Simple Type Inference Algorithm
"... this report : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 6 2 Preliminaries 8 ..."
Abstract
 Add to MetaCart
this report : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 6 2 Preliminaries 8
A Generalized LetPolymorphic Type Inference Algorithm
 Technical Memorandum ROPAS20005, Research on Program Analysis System, Korea Advanced Institute of Science and Technology
, 2000
"... We present a generalized letpolymorphic type inference algorithm, prove that any of its instances is sound and complete with respect to the Hindley/Milner letpolymorphic type system, and find a condition on two instance algorithms so that one algorithm should find type errors earlier than the othe ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
We present a generalized letpolymorphic type inference algorithm, prove that any of its instances is sound and complete with respect to the Hindley/Milner letpolymorphic type system, and find a condition on two instance algorithms so that one algorithm should find type errors earlier than
A Type Inference Algorithm for Pure Type Systems
, 1995
"... A large class of typed lambda calculi can be described. in a uniform way as Pure Type Systems(PTS's). This includes for instance ~he secondorder lambda calculus and the Calculus of Constructions. There are several implementations of PTS's such as COQ, LEGO or CONSTRUCTOR. It is important ..."
Abstract
 Add to MetaCart
. It is important to know that these implementantions are actually correct. In this paper we present an efficient algorithm for infering types for singly sorted Pure Type Systems and prove its correctness. 1
Generalizing HindleyMilner Type Inference Algorithms
, 2002
"... Type inferencing according to the standard algorithms often yields uninformative error messages. Many times, this is a consequence of a bias inherent in the algorithms. The method developed here is to first collect constraints from the program, and to solve these afterwards, possibly under t ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
Type inferencing according to the standard algorithms often yields uninformative error messages. Many times, this is a consequence of a bias inherent in the algorithms. The method developed here is to first collect constraints from the program, and to solve these afterwards, possibly under
Proofs about a Folklore LetPolymorphic Type Inference Algorithm
 ACM Transactions on Programming Languages and Systems
, 1998
"... The Hindley/Milner letpolymorphic type inference system has two different algorithms: one is the de facto standard Algorithm W that is bottomup (or contextinsensitive), and the other is a "folklore" algorithm that is topdown (or contextsensitive). Because the latter algorithm has not ..."
Abstract

Cited by 57 (1 self)
 Add to MetaCart
The Hindley/Milner letpolymorphic type inference system has two different algorithms: one is the de facto standard Algorithm W that is bottomup (or contextinsensitive), and the other is a "folklore" algorithm that is topdown (or contextsensitive). Because the latter algorithm has
Reducing the Memory Complexity of TypeInference Algorithms
, 2002
"... In the Java Virtual Machine, the bytecode veri er checks lowlevel security properties that ensure that the downloaded code cannot bypass the virtual machine's security mechanisms. One of the statically ensured properties is type safety. The typeinference phase is the overwhelming resour ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In the Java Virtual Machine, the bytecode veri er checks lowlevel security properties that ensure that the downloaded code cannot bypass the virtual machine's security mechanisms. One of the statically ensured properties is type safety. The typeinference phase is the overwhelming
V.: A type inference algorithm for secure ambients
 Electr. Notes Theor. Comput. Sci
, 2001
"... We consider a type discipline for the Ambient Calculus that associates ambients with security levels and constrains them to be traversed by or opened in ambients of higher security clearance only. We present a bottomup algorithm that, given an untyped process P, computes a minimal set of constraint ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We consider a type discipline for the Ambient Calculus that associates ambients with security levels and constrains them to be traversed by or opened in ambients of higher security clearance only. We present a bottomup algorithm that, given an untyped process P, computes a minimal set
Reducing the Memory Complexity of TypeInference Algorithms
, 2002
"... In the Java Virtual Machine, the bytecode verifier checks lowlevel security properties that ensure that the downloaded code cannot bypass the virtual machine's security mechanisms. One of the statically ensured properties is type safety. The typeinference phase is the overwhelming resour ..."
Abstract
 Add to MetaCart
In the Java Virtual Machine, the bytecode verifier checks lowlevel security properties that ensure that the downloaded code cannot bypass the virtual machine's security mechanisms. One of the statically ensured properties is type safety. The typeinference phase is the overwhelming
Results 1  10
of
57,992