Sciweavers

596 search results - page 81 / 120
» Subtyping Recursive Types
Sort
View
COLT
2003
Springer
15 years 6 months ago
Learning All Subfunctions of a Function
Sublearning, a model for learning of subconcepts of a concept, is presented. Sublearning a class of total recursive functions informally means to learn all functions from that cla...
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen
FOSSACS
2004
Springer
15 years 6 months ago
On Term Rewriting Systems Having a Rational Derivation
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down system...
Antoine Meyer
ATAL
2003
Springer
15 years 6 months ago
A Taxonomy of Autonomy in Multiagent Organisation
Abstract. Starting from a general definition of how to model the organisation of multiagent systems with the aid of holonic structures, we discuss design parameters for such struc...
Michael Schillo, Klaus Fischer
ENTCS
2007
100views more  ENTCS 2007»
15 years 1 months ago
Lightweight Static Capabilities
We describe a modular programming style that harnesses modern type systems to verify safety conditions in practical systems. This style has three ingredients: (i) A compact kernel...
Oleg Kiselyov, Chung-chieh Shan
LICS
2009
IEEE
15 years 8 months ago
Logical Step-Indexed Logical Relations
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...
Derek Dreyer, Amal Ahmed, Lars Birkedal