Results 1  10
of
4,792,369
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 12976 (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
Elaboration in dependent type theory
"... Abstract. We describe the elaboration algorithm that is used in Lean, a new interactive theorem prover based on dependent type theory. To be practical, interactive theorem provers must provide mechanisms to resolve ambiguities and infer implicit information, thereby supporting convenient input of ex ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We describe the elaboration algorithm that is used in Lean, a new interactive theorem prover based on dependent type theory. To be practical, interactive theorem provers must provide mechanisms to resolve ambiguities and infer implicit information, thereby supporting convenient input
Collection Principles in Dependent Type Theory
 Types for Proofs and Programs, International Workshop, TYPES 2000
, 2001
"... We introduce logicenriched intuitionistic type theories, that extend intuitionistic dependent type theories with primitive judgements to express logic. By adding type theoretic rules that correspond to the collection axiom schemes of the constructive set theory CZF we obtain a generalisation of ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
We introduce logicenriched intuitionistic type theories, that extend intuitionistic dependent type theories with primitive judgements to express logic. By adding type theoretic rules that correspond to the collection axiom schemes of the constructive set theory CZF we obtain a generalisation
Interactive Programs in Dependent Type Theory
, 2000
"... . We propose a representation of interactive systems in dependent type theory. This is meant as a basis for an execution environment for dependently typed programs, and for reasoning about their construction; there may be wider applications. The inspiration is the `I/Omonad' of Haskell. The fu ..."
Abstract
 Add to MetaCart
. We propose a representation of interactive systems in dependent type theory. This is meant as a basis for an execution environment for dependently typed programs, and for reasoning about their construction; there may be wider applications. The inspiration is the `I/Omonad' of Haskell
Interactive Programs in Dependent Type Theory
, 2000
"... . We propose a representation of interactive systems in dependent ..."
Abstract

Cited by 43 (10 self)
 Add to MetaCart
. We propose a representation of interactive systems in dependent
ObjectOriented Programming in Dependent Type Theory
"... Abstract: We introduce basic concepts from objectoriented programming into dependent type theory based on the idea of modelling objects as interactive programs. We consider methods, interfaces, and the interaction between a fixed number of objects, including selfreferential method calls. We introd ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract: We introduce basic concepts from objectoriented programming into dependent type theory based on the idea of modelling objects as interactive programs. We consider methods, interfaces, and the interaction between a fixed number of objects, including selfreferential method calls. We
Translating Dependent Type Theory into Higher Order Logic
 IN PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON TYPED LAMBDA CALCULI AND APPLICATIONS, VOLUME 664 OF LECTURE NOTES IN COMPUTER SCIENCE
, 1993
"... This paper describes a translation of the complex calculus of dependent type theory into the relatively simpler higher order logic originally introduced by Church. In particular, it shows how type dependency as found in MartinLöf's Intuitionistic Type Theory can be simulated in the formulat ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
This paper describes a translation of the complex calculus of dependent type theory into the relatively simpler higher order logic originally introduced by Church. In particular, it shows how type dependency as found in MartinLöf's Intuitionistic Type Theory can be simulated
Some open(?) problems concerning Dependent Type Theories ∗
, 2012
"... The aim of this note is to state some problems that are open, as far as I am aware, concerning the logical strength of some dependent type theories. In section 2 I will first state the problems in a rather informal way and then give two more precise versions concerning specific type theories. A sele ..."
Abstract
 Add to MetaCart
The aim of this note is to state some problems that are open, as far as I am aware, concerning the logical strength of some dependent type theories. In section 2 I will first state the problems in a rather informal way and then give two more precise versions concerning specific type theories. A
Dependent type theory of stateful higherorder functions
, 2005
"... In this paper we investigate a logic for reasoning about programs with higherorder functions and effectful features like nontermination and state with aliasing. We propose a dependent type theory HTT (short for Hoare Type Theory), where types serve as program specifications. In case of effectful p ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
In this paper we investigate a logic for reasoning about programs with higherorder functions and effectful features like nontermination and state with aliasing. We propose a dependent type theory HTT (short for Hoare Type Theory), where types serve as program specifications. In case of effectful
Results 1  10
of
4,792,369