AbstractIn this paper, we represent in type theory a proof system for refinement of algebraic specifications in ASL [10]. The representation is not adequate but full because the use of proof obligations to represent side-conditions. Using this representation, we can develop a proof tactic to help the development of proofs of refinement
We develop an explicit two level system that allows programmers to reason about the behavior of effe...
This dissertation is concerned with interactive proof construction and automated proof search in typ...
Dependently typed programming languages and proof assistants such as Agda and Coq rely on computatio...
AbstractIn this paper, we represent in type theory a proof system for refinement of algebraic specif...
AbstractA language called ASL for describing structured algebraic specifications is presented. ASL i...
Refinement types sharpen systems of simple and dependent types by offering expressive means to more ...
Abstract. Refinement types sharpen systems of simple and dependent types by offering expressive mean...
AbstractA rigorous treatment of types as sets is given for the refinement calculus, a method of impe...
Abstract. TLA+ is a specification language, mainly intended for concurrent and distributed systems. ...
Refinement types sharpen systems of simple and dependent types by offeringexpressive means to more p...
In this paper we present finitary proof systems for the deduction of sentences from algebraic specif...
A gentle introduction for graduate students and researchers in the art of formalizing mathematics on...
The logic programming refinement calculus is a method for transforming specifications to executable ...
The extensive use of computers in mathematics and engineering has led to an increased demand for rel...
The refinement calculus provides a framework for the stepwise development of imperative programs fro...
We develop an explicit two level system that allows programmers to reason about the behavior of effe...
This dissertation is concerned with interactive proof construction and automated proof search in typ...
Dependently typed programming languages and proof assistants such as Agda and Coq rely on computatio...
AbstractIn this paper, we represent in type theory a proof system for refinement of algebraic specif...
AbstractA language called ASL for describing structured algebraic specifications is presented. ASL i...
Refinement types sharpen systems of simple and dependent types by offering expressive means to more ...
Abstract. Refinement types sharpen systems of simple and dependent types by offering expressive mean...
AbstractA rigorous treatment of types as sets is given for the refinement calculus, a method of impe...
Abstract. TLA+ is a specification language, mainly intended for concurrent and distributed systems. ...
Refinement types sharpen systems of simple and dependent types by offeringexpressive means to more p...
In this paper we present finitary proof systems for the deduction of sentences from algebraic specif...
A gentle introduction for graduate students and researchers in the art of formalizing mathematics on...
The logic programming refinement calculus is a method for transforming specifications to executable ...
The extensive use of computers in mathematics and engineering has led to an increased demand for rel...
The refinement calculus provides a framework for the stepwise development of imperative programs fro...
We develop an explicit two level system that allows programmers to reason about the behavior of effe...
This dissertation is concerned with interactive proof construction and automated proof search in typ...
Dependently typed programming languages and proof assistants such as Agda and Coq rely on computatio...
DOI
Add to ORKG