AbstractThe approach to reasoning about structural operational semantics style specifications supported by the Abella system is discussed. This approach uses λ-tree syntax to treat object language binding and encodes binding related properties in generic judgments. Further, object language specifications are embedded directly into the reasoning framework through recursive definitions. The treatment of binding via generic judgments implicitly enforces distinctness and atomicity in the names used for bound variables. These properties must, however, be made explicit in reasoning tasks. This objective can be achieved by allowing recursive definitions to also specify generic properties of atomic predicates. The utility of these various logical f...
AbstractLambda tree syntax (a variant of HOAS) and nominal techniques are two approaches to represen...
AbstractThis paper shows how rewriting logic semantics (RLS) can be used as a computational logic fr...
AbstractWe review links between three logic formalisms and three approaches to specifying operationa...
International audienceRelational descriptions have been used in formalizing diverse computational no...
International audienceWe present a tutorial on the Abella theorem prover that is designed to reason ...
The Abella interactive theorem prover is based on an intuitionistic logic that allows for inductive ...
The Abella interactive theorem prover is based on an intuitionistic logic that allows for inductive ...
The operational semantics of programming and specification languages is often presented via inferenc...
This thesis concerns the development of a framework that facilitates the design and analysis of form...
AbstractOperational semantics is often presented in a rather syntactic fashion using relations speci...
International audienceHypothetical judgments go hand-in-hand with higher-order abstract syntax for m...
AbstractThis paper presents an extension of a proof system for encoding generic judgments, the logic...
Abstract. This paper presents an extension of a proof system for encoding generic judgments, the log...
International audienceThe two-level logic approach (2LL) to reasoning about computational specificat...
University of Minnesota Ph.D. dissertation. September 2009. Major: Computer Science. Advisor: Gopala...
AbstractLambda tree syntax (a variant of HOAS) and nominal techniques are two approaches to represen...
AbstractThis paper shows how rewriting logic semantics (RLS) can be used as a computational logic fr...
AbstractWe review links between three logic formalisms and three approaches to specifying operationa...
International audienceRelational descriptions have been used in formalizing diverse computational no...
International audienceWe present a tutorial on the Abella theorem prover that is designed to reason ...
The Abella interactive theorem prover is based on an intuitionistic logic that allows for inductive ...
The Abella interactive theorem prover is based on an intuitionistic logic that allows for inductive ...
The operational semantics of programming and specification languages is often presented via inferenc...
This thesis concerns the development of a framework that facilitates the design and analysis of form...
AbstractOperational semantics is often presented in a rather syntactic fashion using relations speci...
International audienceHypothetical judgments go hand-in-hand with higher-order abstract syntax for m...
AbstractThis paper presents an extension of a proof system for encoding generic judgments, the logic...
Abstract. This paper presents an extension of a proof system for encoding generic judgments, the log...
International audienceThe two-level logic approach (2LL) to reasoning about computational specificat...
University of Minnesota Ph.D. dissertation. September 2009. Major: Computer Science. Advisor: Gopala...
AbstractLambda tree syntax (a variant of HOAS) and nominal techniques are two approaches to represen...
AbstractThis paper shows how rewriting logic semantics (RLS) can be used as a computational logic fr...
AbstractWe review links between three logic formalisms and three approaches to specifying operationa...