Sciweavers

2414 search results - page 25 / 483
» Computing Normal Subgroups
Sort
View
POPL
1997
ACM
13 years 11 months ago
Call by Need Computations to Root-Stable Form
The following theorem of Huet and L
Aart Middeldorp
TLCA
1993
Springer
13 years 11 months ago
Program Extraction from Normalization Proofs
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...
Ulrich Berger
ENTCS
2008
101views more  ENTCS 2008»
13 years 7 months ago
Normalization for the Simply-Typed Lambda-Calculus in Twelf
Normalization for the simply-typed -calculus is proven in Twelf, an implementation of the Edinburgh Logical Framework. Since due to proof-theoretical restrictions Twelf Tait'...
Andreas Abel
ICPR
2000
IEEE
13 years 11 months ago
Color Texture Classification by Normalized Color Space Representation
This paper proposes a novel approach to color texture characterization and classification. Rather than developing new textural features, we propose to derive a family of new, redu...
Constantin Vertan, Nozha Boujemaa
CORR
2008
Springer
104views Education» more  CORR 2008»
13 years 7 months ago
Stable normal forms for polynomial system solving
This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal I. The criterion used in the computation involves specific commutation polynomial...
Bernard Mourrain, Philippe Trebuchet