Add to ORKGIn this paper we present finitary proof systems for the deduction of sentences from algebraic specifications inductively defined by specification expresssions in first-order and higher-order logic. Mainly, we redesign the proof systems for the reachability and behavioural operators. The main application of the result is to give an adequate representation of this kind of proof systems in a type-theoretic logical framework
AbstractIn this paper we study a first-order language that allows to express and prove properties re...
Article dans revue scientifique avec comité de lecture. nationale.National audienceIn most algebraic...
Abstract. Codatatypes are absent from many programming languages and proof assistants. We make a cas...
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...
We study the higher-order rewrite/equational proof systems obtained by adding the simply typed lambd...
We show how codatatypes can be employed to produce compact, high-level proofs of key results in logi...
AbstractAn inferential semantics for full Higher Order Logic (HOL) is proposed. The paper presents a...
Abstract. This paper is part of a general project of developing a sys-tematic and algebraic proof th...
We consider the EFO fragment of simple type theory, which restricts quan-tification and equality to ...
An inferential semantics for full Higher Order Logic (HOL) is proposed. The paper presents a constru...
This dissertation pertains to algebraic proof theory, a research field aimed at solving problems in ...
The main goal of this paper is to present a method for translation to clause form in finitely-valued...
the date of receipt and acceptance should be inserted later Abstract Codatatypes are absent from man...
Although logic and proof theory have been successfully used as a framework for the specification of ...
AbstractIn this paper we study a first-order language that allows to express and prove properties re...
Article dans revue scientifique avec comité de lecture. nationale.National audienceIn most algebraic...
Abstract. Codatatypes are absent from many programming languages and proof assistants. We make a cas...
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...
We study the higher-order rewrite/equational proof systems obtained by adding the simply typed lambd...
We show how codatatypes can be employed to produce compact, high-level proofs of key results in logi...
AbstractAn inferential semantics for full Higher Order Logic (HOL) is proposed. The paper presents a...
Abstract. This paper is part of a general project of developing a sys-tematic and algebraic proof th...
We consider the EFO fragment of simple type theory, which restricts quan-tification and equality to ...
An inferential semantics for full Higher Order Logic (HOL) is proposed. The paper presents a constru...
This dissertation pertains to algebraic proof theory, a research field aimed at solving problems in ...
The main goal of this paper is to present a method for translation to clause form in finitely-valued...
the date of receipt and acceptance should be inserted later Abstract Codatatypes are absent from man...
Although logic and proof theory have been successfully used as a framework for the specification of ...
AbstractIn this paper we study a first-order language that allows to express and prove properties re...
Article dans revue scientifique avec comité de lecture. nationale.National audienceIn most algebraic...
Abstract. Codatatypes are absent from many programming languages and proof assistants. We make a cas...