Recursive Schema Definitions in Object-Z
نویسنده
چکیده
Unlike Z, Object-Z allows schemas to be defined recursively. This enables mutual and self recursive structures, commonly occurring in object-oriented programs, to be readily specified. In this paper, we provide a fixed point interpretation of such definitions. In addition, we provide simple guidelines for producing non-recursive schema definitions which are semantically identical to recursive ones.
منابع مشابه
Diagonal arguments and fixed points
A universal schema for diagonalization was popularized by N.S. Yanofsky (2003), based on a pioneering work of F.W. Lawvere (1969), in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema. Here, we fi...
متن کاملComparison of object relationships, schema modes, and childhood trauma in individuals with borderline and obsessive-compulsive personality disorders symptoms
This study aimed to compare schema modes, childhood trauma, and object relationships in individuals with borderline personality and obsessive-compulsive disorder symptoms. The research method was causal-comparative and the statistical population of this study included all people who were referred to public and private counseling centers in Tehran city in 2019, of whom 90 people with borderline ...
متن کاملA Finite Axiomatization of Inductive-Recursive Definitions
Induction-recursion is a schema which formalizes the principles for introducing new sets in Martin-Löf’s type theory. It states that we may inductively define a set while simultaneously defining a function from this set into an arbitrary type by structural recursion. This extends the notion of an inductively defined set substantially and allows us to introduce universes and higher order univers...
متن کاملAnother Look at Function Domains
Bove and Capretta have presented a method to deal with partial and general recursive functions in constructive type theory which relies on an inductive characterisation of the domains of the functions. The method separates the logical and the computational aspects of an algorithm, and facilitates the formal verification of the functions being defined. For nested recursive functions, the method ...
متن کاملDefinition of External Schemas in Object Oriented Databases
In this work, a new external schema definition methodology for object oriented databases (OODB) that solves some of the problems of existing methodologies is presented. In particular, this new methodology avoids the need for generating derived classes that are not directly used in the defined external schema. Also, it offers a way of integrating and reusing different external schema definitions.
متن کامل