Sciweavers

303 search results - page 22 / 61
» Theory Interpretation in Simple Type Theory
Sort
View
FP
1991
95views Formal Methods» more  FP 1991»
13 years 11 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
IWCLS
2007
Springer
14 years 1 months ago
On Lookahead and Latent Learning in Simple LCS
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...
Larry Bull
ESOP
2000
Springer
13 years 11 months ago
Type Classes with Functional Dependencies
Abstract. Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with a potentially different implementation in each case. For ...
Mark P. Jones
POPL
2006
ACM
14 years 7 months ago
Polymorphic regular tree types and patterns
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
Jerome Vouillon
COGSCI
2010
93views more  COGSCI 2010»
13 years 7 months ago
The Evolution of Relevance
With human language, the same utterance can have different meanings in different contexts. Nevertheless, listeners almost invariably converge upon the correct intended meaning. Th...
Thomas C. Scott-Phillips