Sciweavers

605 search results - page 11 / 121
» Normalizers and Split Extensions
Sort
View
RTA
2007
Springer
15 years 4 months ago
Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi
We present a method of lifting to explicit substitution calculi some characterizations of the strongly normalizing terms of λ-calculus by means of intersection type systems. The m...
Kentaro Kikuchi
TLCA
2001
Springer
15 years 3 months ago
Strong Normalization of Classical Natural Deduction with Disjunction
We introduce λµ→∧∨⊥ , an extension of Parigot’s λµ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutati...
Philippe de Groote
AIRS
2006
Springer
15 years 2 months ago
Evaluating Score Normalization Methods in Data Fusion
In data fusion, score normalization is a step to make scores, which are obtained from different component systems for all documents, comparable to each other. It is an indispensabl...
Shengli Wu, Fabio Crestani, Yaxin Bi
FPL
2006
Springer
95views Hardware» more  FPL 2006»
15 years 2 months ago
A Reconfigurable Functional Unit for an Adaptive Dynamic Extensible Processor
This paper presents a reconfigurable functional unit (RFU) for an adaptive dynamic extensible processor. The processor can tune its extended instructions to the target application...
Hamid Noori, Farhad Mehdipour, Kazuaki Murakami, K...
APAL
2006
107views more  APAL 2006»
14 years 10 months ago
Frege systems for extensible modal logics
By a well-known result of Cook and Reckhow [4, 12], all Frege systems for the Classical Propositional Calculus (CPC) are polynomially equivalent. Mints and Kojevnikov [11] have re...
Emil Jerábek