Sciweavers

5510 search results - page 241 / 1102
» Mathematics
Sort
View
POPL
2004
ACM
16 years 6 months ago
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
We present a notion of -long ? -normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in norm...
Vincent Balat, Roberto Di Cosmo, Marcelo P. Fiore
CADE
2008
Springer
16 years 6 months ago
A Small Framework for Proof Checking
We describe a framework with which first order theorem provers can be used for checking formal proofs. The main aim of the framework is to take as much advantage as possible from t...
Hans de Nivelle, Piotr Witkowski
CADE
2004
Springer
16 years 6 months ago
Formalizing Undefinedness Arising in Calculus
Abstract. Undefined terms are commonplace in mathematics, particularly in calculus. The traditional approach to undefinedness in mathematical practice is to treat undefined terms a...
William M. Farmer
STOC
2003
ACM
122views Algorithms» more  STOC 2003»
16 years 6 months ago
Learning juntas
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
16 years 3 months ago
Data-Specific Analysis of String Sorting
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...
Raimund Seidel