Sciweavers

8768 search results - page 24 / 1754
» Generalizing the notion of support
Sort
View
FP
1991
95views Formal Methods» more  FP 1991»
15 years 5 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
WOLLIC
2009
Springer
15 years 8 months ago
Recognizability in the Simply Typed Lambda-Calculus
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
Sylvain Salvati
CEEMAS
2005
Springer
15 years 7 months ago
A Complexity Based Feature to Support Emergence in MAS
Emergence is a widespread notion in complex systems, artificial life and multi-agent systems. In this paper, we try to clarify a specific emergence feature suggested by John Holl...
Joris Deguet, Yves Demazeau
FASE
2007
Springer
15 years 8 months ago
Declared Type Generalization Checker: An Eclipse Plug-In for Systematic Programming with More General Types
The Declared Type Generalization Checker is a plug-in for Eclipse’s Java Development Tools (JDT) that supports developers in systematically finding and using better fitting types...
Markus Bach, Florian Forster, Friedrich Steimann
PODS
2007
ACM
142views Database» more  PODS 2007»
16 years 2 months ago
Quasi-inverses of schema mappings
Schema mappings are high-level specifications that describe the relationship between two database schemas. Two operators on schema mappings, namely the composition operator and th...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...