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 describe a syntactical proof-reconstruction approach to verify derivations generated by Metis pro...
AbstractThis volume contains the proceedings of the third Workshop on Proof Search in Type-Theoretic...
A gentle introduction for graduate students and researchers in the art of formalizing mathematics on...
AbstractIn this paper, we represent in type theory a proof system for refinement of algebraic specif...
AbstractMathematical proofs, as written in every-day Common Mathematical Language (CML), are informa...
A TYPE -THEORETIC APPROACH TO PROOF SUPPORT FOR ALGEBRAIC ...
The extensive use of computers in mathematics and engineering has led to an increased demand for rel...
In this paper we present finitary proof systems for the deduction of sentences from algebraic specif...
International audienceDependently typed programming languages and proof assistants such as Agda and ...
Abstract. Refinement types sharpen systems of simple and dependent types by offering expressive mean...
Refinement types sharpen systems of simple and dependent types by offering expressive means to more ...
AbstractA language called ASL for describing structured algebraic specifications is presented. ASL i...
Refinement types sharpen systems of simple and dependent types by offeringexpressive means to more p...
Meseguer and Rosu proposed rewriting logic semantics (RLS) as a programming language definitional fr...
AbstractWe study how the type theory Fω can be adequately represented in the meta-logical framework ...
We describe a syntactical proof-reconstruction approach to verify derivations generated by Metis pro...
AbstractThis volume contains the proceedings of the third Workshop on Proof Search in Type-Theoretic...
A gentle introduction for graduate students and researchers in the art of formalizing mathematics on...
AbstractIn this paper, we represent in type theory a proof system for refinement of algebraic specif...
AbstractMathematical proofs, as written in every-day Common Mathematical Language (CML), are informa...
A TYPE -THEORETIC APPROACH TO PROOF SUPPORT FOR ALGEBRAIC ...
The extensive use of computers in mathematics and engineering has led to an increased demand for rel...
In this paper we present finitary proof systems for the deduction of sentences from algebraic specif...
International audienceDependently typed programming languages and proof assistants such as Agda and ...
Abstract. Refinement types sharpen systems of simple and dependent types by offering expressive mean...
Refinement types sharpen systems of simple and dependent types by offering expressive means to more ...
AbstractA language called ASL for describing structured algebraic specifications is presented. ASL i...
Refinement types sharpen systems of simple and dependent types by offeringexpressive means to more p...
Meseguer and Rosu proposed rewriting logic semantics (RLS) as a programming language definitional fr...
AbstractWe study how the type theory Fω can be adequately represented in the meta-logical framework ...
We describe a syntactical proof-reconstruction approach to verify derivations generated by Metis pro...
AbstractThis volume contains the proceedings of the third Workshop on Proof Search in Type-Theoretic...
A gentle introduction for graduate students and researchers in the art of formalizing mathematics on...
DOI
Add to ORKG