Sciweavers

1101 search results - page 152 / 221
» Forcing in proof theory
Sort
View
90
Voted
FOCM
2010
160views more  FOCM 2010»
14 years 11 months ago
Boundary Measures for Geometric Inference
We study the boundary measures of compact subsets of the d-dimensional Euclidean space, which are closely related to Federer’s curvature measures. We show that they can be comput...
Frédéric Chazal, David Cohen-Steiner...
109
Voted
LICS
2010
IEEE
14 years 11 months ago
Equality Is Typable in Semi-full Pure Type Systems
—There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed ...
Vincent Siles, Hugo Herbelin
CORR
2010
Springer
84views Education» more  CORR 2010»
14 years 10 months ago
Termination Casts: A Flexible Approach to Termination with General Recursion
This paper proposes a type-and-effect system called Teq, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambd...
Aaron Stump, Vilhelm Sjöberg, Stephanie Weiri...
119
Voted
IMCSIT
2010
14 years 10 months ago
Emotional Speech Analysis using Artificial Neural Networks
In the present text, we deal with the problem of classification of speech emotion. Problems of speech processing are addressed through the use of artificial neural networks (ANN). ...
Jana Tucková, Martin Sramka
126
Voted
LPAR
2010
Springer
14 years 10 months ago
Logic and Computation in a Lambda Calculus with Intersection and Union Types
We present an explicitly typed lambda calculus "`a la Church" based on the union and intersection types discipline; this system is the counterpart of the standard type a...
Daniel J. Dougherty, Luigi Liquori