Add to ORKGWe report on a new environment developed and implemented inside the Nuprl type theory that facilitates proving theorems about partial functions. It is the first such automated type-theoretic account of partiality. We demonstrate that such an environment can be used effectively for proving theorems about computability and for developing partial programs with correctness proofs. This extends the well-known proofs as programs paradigm to partial functions
This thesis investigates various formal systems for reasoning about partial functions or partial ele...
The need to use partial functions arises frequently in formal descriptions of computer systems. Howe...
This paper presents a portion of the work on specification, design, and implementation of safety-cri...
computability theory : : : : : : : : : : : : : : : : : : : : : : 82 5.5 Building a partial object ty...
The starting point for this thesis is the Nuprl proof development system. Nuprl is an environment fo...
As our society becomes technologically more complex, computers are being used in greater and greater...
Simply-typed set-theoretic languages such as Z and B are widely used for program and system specific...
Abstract. This paper extends the proof methods used by the Nuprl proof assistant to reason about the...
As our society becomes technologically more complex, computers are being used in greater and greater...
We have developed powerful environments within the Nuprl Proof Development System for problem solvi...
AbstractPartial functions are the most suitable characterization of program effects. Formal reasonin...
The type theories we consider are adequate for the foundations of mathematics and computer science....
This paper describes an implementation within Nuprl of mechanisms that support the use of Nuprl's t...
We investigate partial functions and computability theory from within a constructive, univalent type...
Constructive type theories generally treat only total functions; partial functions present serious ...
This thesis investigates various formal systems for reasoning about partial functions or partial ele...
The need to use partial functions arises frequently in formal descriptions of computer systems. Howe...
This paper presents a portion of the work on specification, design, and implementation of safety-cri...
computability theory : : : : : : : : : : : : : : : : : : : : : : 82 5.5 Building a partial object ty...
The starting point for this thesis is the Nuprl proof development system. Nuprl is an environment fo...
As our society becomes technologically more complex, computers are being used in greater and greater...
Simply-typed set-theoretic languages such as Z and B are widely used for program and system specific...
Abstract. This paper extends the proof methods used by the Nuprl proof assistant to reason about the...
As our society becomes technologically more complex, computers are being used in greater and greater...
We have developed powerful environments within the Nuprl Proof Development System for problem solvi...
AbstractPartial functions are the most suitable characterization of program effects. Formal reasonin...
The type theories we consider are adequate for the foundations of mathematics and computer science....
This paper describes an implementation within Nuprl of mechanisms that support the use of Nuprl's t...
We investigate partial functions and computability theory from within a constructive, univalent type...
Constructive type theories generally treat only total functions; partial functions present serious ...
This thesis investigates various formal systems for reasoning about partial functions or partial ele...
The need to use partial functions arises frequently in formal descriptions of computer systems. Howe...
This paper presents a portion of the work on specification, design, and implementation of safety-cri...