Add to ORKGThis document presents and Isabelle formalization of a general theory of syntax with bindings. It also includes some case studies from the theory of lambda-calculus.unpublishednot peer reviewe
Isabelle [Pau94] is a generic theorem proving environment. It is written in ML, and is part of the L...
General purpose theorem provers provide advanced facilities for proving properties about specificati...
AbstractA formalized theory of alpha-conversion for the π-calculus in Isabelle/HOL is presented. Fol...
This document presents and Isabelle formalization of a general theory of syntax with bindings. It al...
This is a browsable html document presenting an Isabelle formalization of a general theory of syntax...
Abstract. Nominal Isabelle is a definitional extension of the Isabelle/HOL theo-rem prover. It provi...
Nominal Isabelle is a definitional extension of the Isabelle/HOL theoremprover. It provides a provin...
This paper is about completely formal representation of languages with binding. We have previously w...
In this thesis we give a general theory of syntax with bindings. We address the problem from a mathe...
Abstract. Nominal Isabelle is a framework for reasoning about pro-gramming languages with named boun...
This book is two books. Part I is a practical introduction to working with the Isabelle proof assist...
Abstract: We present the Isabelle/HOL formalisation of some key equa-tional properties of the untype...
We develop a theory of syntax with bindings, focusing on: - methodological issues concerning the ...
We develop a theory of syntax with bindings, focusing on:- methodological issues concerning the conv...
AbstractWe describe in this paper formalisations for the properties of weakening, type-substitutivit...
Isabelle [Pau94] is a generic theorem proving environment. It is written in ML, and is part of the L...
General purpose theorem provers provide advanced facilities for proving properties about specificati...
AbstractA formalized theory of alpha-conversion for the π-calculus in Isabelle/HOL is presented. Fol...
This document presents and Isabelle formalization of a general theory of syntax with bindings. It al...
This is a browsable html document presenting an Isabelle formalization of a general theory of syntax...
Abstract. Nominal Isabelle is a definitional extension of the Isabelle/HOL theo-rem prover. It provi...
Nominal Isabelle is a definitional extension of the Isabelle/HOL theoremprover. It provides a provin...
This paper is about completely formal representation of languages with binding. We have previously w...
In this thesis we give a general theory of syntax with bindings. We address the problem from a mathe...
Abstract. Nominal Isabelle is a framework for reasoning about pro-gramming languages with named boun...
This book is two books. Part I is a practical introduction to working with the Isabelle proof assist...
Abstract: We present the Isabelle/HOL formalisation of some key equa-tional properties of the untype...
We develop a theory of syntax with bindings, focusing on: - methodological issues concerning the ...
We develop a theory of syntax with bindings, focusing on:- methodological issues concerning the conv...
AbstractWe describe in this paper formalisations for the properties of weakening, type-substitutivit...
Isabelle [Pau94] is a generic theorem proving environment. It is written in ML, and is part of the L...
General purpose theorem provers provide advanced facilities for proving properties about specificati...
AbstractA formalized theory of alpha-conversion for the π-calculus in Isabelle/HOL is presented. Fol...