Sciweavers

581 search results - page 45 / 117
» Translating dependency into parametricity
Sort
View
HASKELL
2005
ACM
14 years 3 months ago
Verifying haskell programs using constructive type theory
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
Andreas Abel, Marcin Benke, Ana Bove, John Hughes,...
AI
2006
Springer
13 years 10 months ago
On the computational complexity of coalitional resource games
We study Coalitional Resource Games (CRGs), a variation of Qualitative Coalitional Games (QCGs) in which each agent is endowed with a set of resources, and the ability of a coalit...
Michael Wooldridge, Paul E. Dunne
CADE
2003
Springer
14 years 10 months ago
Subset Types and Partial Functions
A classical higher-order logic PFsub of partial functions is defined. The logic extends a version of Farmer's logic PF by enriching the type system of the logic with subset ty...
Aaron Stump
IALP
2010
13 years 4 months ago
Sentence Similarity-Based Source Context Modelling in PBSMT
Target phrase selection, a crucial component of the state-of-the-art phrase-based statistical machine translation (PBSMT) model, plays a key role in generating accurate translation...
Rejwanul Haque, Sudip Kumar Naskar, Andy Way, Mart...
DATE
2008
IEEE
137views Hardware» more  DATE 2008»
14 years 4 months ago
SPARE - a Scalable algorithm for passive, structure preserving, Parameter-Aware model order REduction
In this paper we describe a flexible and efficient new algorithm for model order reduction of parameterized systems. The method is based on the reformulation of the parametric s...
Jorge Fernandez Villena, Luis Miguel Silveira