Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
7,755
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
AUTOMATH and Pure Type Systems
, 1996
"... We study the position of Automath systems within the framework of the Pure Type Systems as discussed in [3]. ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
We study the position of Automath systems within the framework of the Pure Type Systems as discussed in [3].
Pure Type Systems with Definitions
, 1993
"... In this paper, an extension of Pure Type Systems (PTS's) with definitions is presented. We prove this extension preserves many of the properties of PTS's. The main result is a proof that for many PTS's, including the Calculus of Constructions, this extension preserves strong normalisa ..."
Abstract
-
Cited by 27 (1 self)
- Add to MetaCart
In this paper, an extension of Pure Type Systems (PTS's) with definitions is presented. We prove this extension preserves many of the properties of PTS's. The main result is a proof that for many PTS's, including the Calculus of Constructions, this extension preserves strong
Domain-Free Pure Type Systems
- JOURNAL OF FUNCTIONAL PROGRAMMING
, 1993
"... Pure type systems make use of domain-full λ-abstractions λx:D.M . We present a variant of pure type systems, which we call domain-free pure type systems, with domain-free λ-abstractions λx.M. Domain-free pure type systems have a number of advantages over both pure type systems and so-called type ass ..."
Abstract
-
Cited by 40 (8 self)
- Add to MetaCart
Pure type systems make use of domain-full λ-abstractions λx:D.M . We present a variant of pure type systems, which we call domain-free pure type systems, with domain-free λ-abstractions λx.M. Domain-free pure type systems have a number of advantages over both pure type systems and so-called type
Pure type systems formalized
- Proceedings of the International Conference on Typed Lambda Calculi and Applications
, 1993
"... ..."
Automath and Pure Type Systems
, 2003
"... We study the position of the Automath systems within the framework of Pure Type Systems (PTSs). In [1,15], a rough relationship has been given between Automath and PTSs. That relationship ignores three of the most important features of Automath: de nitions, parameters and -reduction, because at th ..."
Abstract
- Add to MetaCart
We study the position of the Automath systems within the framework of Pure Type Systems (PTSs). In [1,15], a rough relationship has been given between Automath and PTSs. That relationship ignores three of the most important features of Automath: de nitions, parameters and -reduction, because
Typechecking in Pure Type Systems
- Informal proceedings of Logical Frameworks'92
, 1992
"... Introduction This work is motivated by two related problems. The first is to find reasonable algorithms for typechecking Pure Type Systems [Bar91] (PTS); the second is a technical question about PTS, the so called Expansion Postponment property (EP), which is tantalizingly simple but remains unsolv ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
Introduction This work is motivated by two related problems. The first is to find reasonable algorithms for typechecking Pure Type Systems [Bar91] (PTS); the second is a technical question about PTS, the so called Expansion Postponment property (EP), which is tantalizingly simple but remains
Parameters in Pure Type Systems
"... Abstract. In this paper we add parameters to A-calculus and type theory and show that the resulting systems have nice meta-theoretical properties. We illustrate that parameters allow for a better fine-tuning of the strength of type systems and hence allow for a better description of existing type sy ..."
Abstract
- Add to MetaCart
systems in the framework of pure type systems. 1 What are parameters? Functions playa fundamental role in logic, mathematics and computer science. In the nowadays accepted view on functions, they are 'first class citizens', being entities on their own which act on a par with sets, elements
Parameters in Pure Type Systems
, 2002
"... In this paper we study the addition of parameters to typed -calculus with definitions. We show that the resulting systems have nice properties and illustrate that parameters allow for a better fine-tuning of the strength of type systems as well as staying closer to type systems used in practice i ..."
Abstract
- Add to MetaCart
In this paper we study the addition of parameters to typed -calculus with definitions. We show that the resulting systems have nice properties and illustrate that parameters allow for a better fine-tuning of the strength of type systems as well as staying closer to type systems used in practice
Parameters in Pure Type Systems
"... Abstract. In this paper we study the addition of parameters to typed�-calculus with definitions. We show that the resulting systems have nice properties and illustrate that parameters allow for a better fine-tuning of the strength of type systems as well as staying closer to type systems used in pra ..."
Abstract
- Add to MetaCart
Abstract. In this paper we study the addition of parameters to typed�-calculus with definitions. We show that the resulting systems have nice properties and illustrate that parameters allow for a better fine-tuning of the strength of type systems as well as staying closer to type systems used
Results 1 - 10
of
7,755
