Sciweavers

1999 search results - page 69 / 400
» Dependently Typed Grammars
Sort
View
JDCTA
2010
152views more  JDCTA 2010»
15 years 28 days ago
A Semantic Approach to Extract the Final Answer in SBUQA Question Answering System
In this paper we introduce the semantic approach of the answer extraction component of a question answering system called SBUQA. The answer extraction component gets the retrieved...
Mehrnoush Shamsfard, Mahsa Arab Yarmohammadi
CORR
2006
Springer
113views Education» more  CORR 2006»
15 years 6 months ago
Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...
Frédéric Blanqui, Colin Riba
BIRTHDAY
2010
Springer
15 years 6 months ago
Programming Inductive Proofs - A New Approach Based on Contextual Types
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
Brigitte Pientka
ARITH
2009
IEEE
16 years 29 days ago
Advanced Clockgating Schemes for Fused-Multiply-Add-Type Floating-Point Units
The paper introduces fine-grain clockgating schemes for fused multiply-add-type floating-point units (FPU). The clockgating is based on instruction type, precision and operand v...
Jochen Preiss, Maarten Boersma, Silvia Melitta M&u...
ECOOP
2000
Springer
15 years 10 months ago
A Basic Model of Typed Components
This paper studies specific language level abstractions for component-based programming. We propose a simple model which captures some basic ingredients — like explicit context ...
João Costa Seco, Luís Caires