Sciweavers

11397 search results - page 52 / 2280
» A Relational Abstraction for Functions
Sort
View
CORR
2011
Springer
156views Education» more  CORR 2011»
13 years 5 months ago
Extensional Collapse Situations I: non-termination and unrecoverable errors
Abstract. We consider a simple model of higher order, functional computations over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable e...
Antonio Bucciarelli
FP
1991
95views Formal Methods» more  FP 1991»
14 years 1 months ago
Making Functionality More General
The notion of functionality is not cast in stone, but depends upon what we have as types in our language. With partial equivalence relations (pers) as types we show that the funct...
Graham Hutton, Ed Voermans
ECAI
2004
Springer
14 years 3 months ago
A Semantics for Abstraction
ics for abstraction Chiara Ghidini1 and Fausto Giunchiglia2 Abstract. The goal of this paper is to propose a model-theoretic formalization of abstraction, where abstraction is mode...
Chiara Ghidini, Fausto Giunchiglia
NA
2010
114views more  NA 2010»
13 years 8 months ago
Matrix interpretation of multiple orthogonality
Abstract: In this work we give an interpretation of a (s(d + 1) + 1)-term recurrence relation in terms of type II multiple orthogonal polynomials. We rewrite this recurrence relati...
Amílcar Branquinho, Luis Cotrim, Ana Foulqu...
EUROPAR
2010
Springer
13 years 11 months ago
Exceptions for Algorithmic Skeletons
Abstract. Algorithmic Skeletons offer high-level abstractions for parallel programming based on recurrent parallelism patterns. Patterns can be combined and nested into more comple...
Mario Leyton, Ludovic Henrio, José M. Pique...