Results 1 
4 of
4
Infinite Objects in Type Theory
"... . We show that infinite objects can be constructively understood without the consideration of partial elements, or greatest fixedpoints, through the explicit consideration of proof objects. We present then a proof system based on these explanations. According to this analysis, the proof expressions ..."
Abstract

Cited by 83 (2 self)
 Add to MetaCart
. We show that infinite objects can be constructively understood without the consideration of partial elements, or greatest fixedpoints, through the explicit consideration of proof objects. We present then a proof system based on these explanations. According to this analysis, the proof expressions should have the same structure as the program expressions of a pure functional lazy language: variable, constructor, application, abstraction, case expressions, and local let expressions. 1 Introduction The usual explanation of infinite objects relies on the use of greatest fixedpoints of monotone operators, whose existence is justified by the impredicative proof of Tarski's fixed point theorem. The proof theory of such infinite objects, based on the so called coinduction principle, originally due to David Park [21] and explained with this name for instance in the paper [18], reflects this explanation. Constructively, to rely on such impredicative methods is somewhat unsatisfactory (see fo...
Future event logic  axioms and complexity
 In Advances in Modal Logic
"... In this paper we present a sound and complete axiomatization of future event logic. Future event logic is a logic that generalizes a number of dynamic epistemic logics, by using a new operator ⊲ that acts as a quantifier over the set of all refinements of a given model. (A refinement is like a bisim ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
In this paper we present a sound and complete axiomatization of future event logic. Future event logic is a logic that generalizes a number of dynamic epistemic logics, by using a new operator ⊲ that acts as a quantifier over the set of all refinements of a given model. (A refinement is like a bisimulation except that from the three relational requirements only ‘atoms ’ and ‘back ’ need to be satisfied.) Thus the logic combines the simplicity of modal logic with some powers of monadic second order quantification. We prove the axiomatization is sound and complete and discuss some extensions to the result.
Some Industrial Experiences in the Development and Use of Ontologies
 EKAW 2004 WS on Core Ontologies in Ontology Engineering
, 2004
"... Abstract. Ontologies have been part of developing information systems in Shell for some twenty years, taking the form of data models and reference data used within information systems. A problem in reusing or integrating systems is the context that they assume, which may not be valid beyond the scop ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. Ontologies have been part of developing information systems in Shell for some twenty years, taking the form of data models and reference data used within information systems. A problem in reusing or integrating systems is the context that they assume, which may not be valid beyond the scope of an implementation. Lessons learnt include trying to ensure that the context is explicit, and that what are really local rules in a global context are not defined as global rules in a local context. These lessons have been applied in the development of International Standards to provide an architecture for integration and a data model that includes both a foundation ontology that has been developed on a well defined and consistent basis, and provides a framework for extension of the ontology through reference data.
Programming Unconventional Computers: Dynamics, Development, SelfReference
, 2012
"... entropy ..."