Sciweavers

57 search results - page 1 / 12
» A Cartesian Closed Category of Approximable Concept Structur...
Sort
View
ICCS
2004
Springer
13 years 10 months ago
A Cartesian Closed Category of Approximable Concept Structures
Abstract. Infinite contexts and their corresponding lattices are of theoretical and practical interest since they may offer connections with and insights from other mathematical ...
Pascal Hitzler, Guo-Qiang Zhang
APAL
2007
104views more  APAL 2007»
13 years 4 months ago
Non-well-founded trees in categories
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
Benno van den Berg, Federico De Marchi
IMPERIAL
1993
13 years 9 months ago
Deriving Category Theory from Type Theory
This work expounds the notion that (structured) categories are syntax free presentations of type theories, and shows some of the ideas involved in deriving categorical semantics f...
Roy L. Crole
ICEIS
2005
IEEE
13 years 10 months ago
Conditions for Interoperability
Abstract: Interoperability for information systems remains a challenge both at the semantic and organisational levels. The original three-level architecture for local databases nee...
B. Nick Rossiter, Michael A. Heather