AbstractDue to the high level of abstraction involved in formal specification of software systems, nondeterminism comes as an inevitable part of formal specifications. Therefore, support for nondeterminism should be provisioned in developing programs from their formal specifications. In this paper, an existing translation of CZ set theory into Martin-Löf's theory of types is extended to consider nondeterministic specifications in CZ language
Using Martin-L\uf6f\u27s set theory as a programming logic one identifies specifications with sets a...
It is possible to make a natural non-type-theoretic reinterpretation of Martin-Lof's type theory. T...
For certain kinds of applications of type theories, the faithfulness of formalization in the theory ...
AbstractDue to the high level of abstraction involved in formal specification of software systems, n...
The theory of abstract data types is generalized to the case of nondeterministic operations (set-val...
"Nondeterminism in Algebraic Specifications and Algebraic Programs" presents a mathematical theory f...
Programs are interpreted as types in a constructive type theory. Rules for a logic of programs can ...
Since 1970 several methods have been proposed for using formal systems of constructive logic as pro...
. We provide a constructive and intensional interpretation for the specification language Z in a the...
Software systems are ubiquitous. Failure in safety- and security-critical systems, e.g., the control...
AbstractType theories in the sense of Martin-Löf and the NuPRL system are based on taking as primiti...
AbstractWe present the program development concept in a logical framework including constructive typ...
Abstra t Martin-Lof's type theory is a onstru tive type theory originally on eived as a forma...
The need to apply formal specification and development of programs to large problems has highlighted...
Most specification languages have a type system. Type systems are hard to get right, and getting the...
Using Martin-L\uf6f\u27s set theory as a programming logic one identifies specifications with sets a...
It is possible to make a natural non-type-theoretic reinterpretation of Martin-Lof's type theory. T...
For certain kinds of applications of type theories, the faithfulness of formalization in the theory ...
AbstractDue to the high level of abstraction involved in formal specification of software systems, n...
The theory of abstract data types is generalized to the case of nondeterministic operations (set-val...
"Nondeterminism in Algebraic Specifications and Algebraic Programs" presents a mathematical theory f...
Programs are interpreted as types in a constructive type theory. Rules for a logic of programs can ...
Since 1970 several methods have been proposed for using formal systems of constructive logic as pro...
. We provide a constructive and intensional interpretation for the specification language Z in a the...
Software systems are ubiquitous. Failure in safety- and security-critical systems, e.g., the control...
AbstractType theories in the sense of Martin-Löf and the NuPRL system are based on taking as primiti...
AbstractWe present the program development concept in a logical framework including constructive typ...
Abstra t Martin-Lof's type theory is a onstru tive type theory originally on eived as a forma...
The need to apply formal specification and development of programs to large problems has highlighted...
Most specification languages have a type system. Type systems are hard to get right, and getting the...
Using Martin-L\uf6f\u27s set theory as a programming logic one identifies specifications with sets a...
It is possible to make a natural non-type-theoretic reinterpretation of Martin-Lof's type theory. T...
For certain kinds of applications of type theories, the faithfulness of formalization in the theory ...