Results 1 
3 of
3
Nominal Logic: A First Order Theory of Names and Binding
 Information and Computation
, 2001
"... This paper formalises within firstorder logic some common practices in computer science to do with representing and reasoning about syntactical structures involving named bound variables (as opposed to nameless terms, explicit substitutions, or higher order abstract syntax). It introduces Nominal L ..."
Abstract

Cited by 176 (15 self)
 Add to MetaCart
(Show Context)
This paper formalises within firstorder logic some common practices in computer science to do with representing and reasoning about syntactical structures involving named bound variables (as opposed to nameless terms, explicit substitutions, or higher order abstract syntax). It introduces Nominal Logic, a version of firstorder manysorted logic with equality containing primitives for renaming via nameswapping and for freshness of names, from which a notion of binding can be derived. Its axioms express...
A Comparison of Formalizations of the MetaTheory of a Language with Variable Bindings in Isabelle
 Supplemental Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
, 2001
"... Abstract. Theorem provers can be used to reason formally about programming languages and there are various general methods for the formalization of variable binding operators. Hence there are choices for the style of formalization of such languages, even within a single theorem prover. The choice of ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
Abstract. Theorem provers can be used to reason formally about programming languages and there are various general methods for the formalization of variable binding operators. Hence there are choices for the style of formalization of such languages, even within a single theorem prover. The choice of formalization can affect how easy or difficult it is to do automated reasoning. The aim of this paper is to compare and contrast three formalizations (termed de Bruijn, weak HOAS and full HOAS) of a typical functional programming language. Our contribution is a detailed report on our formalizations, a survey of related work, and a final comparative summary, in which we mention a novel approach to a hybrid de Bruijn/HOAS syntax. 1
A MetaLogical Framework Based on Regular Worlds
, 2000
"... . This paper describes the design of a metalogical framework that supports the representation and verication of deductive systems which are prevalent in the areas of programming languages, type theory, and logics. It extends the logical framework LF [HHP93] by a metalogic M + 2 whose soundne ..."
Abstract
 Add to MetaCart
. This paper describes the design of a metalogical framework that supports the representation and verication of deductive systems which are prevalent in the areas of programming languages, type theory, and logics. It extends the logical framework LF [HHP93] by a metalogic M + 2 whose soundness follows from a realizability argument. The metalogical framework is implemented in the Twelf system [PS99]. 1 Introduction The logical framework LF [HHP93] has been designed as a metalanguage for representing deductive systems. It allows concise encodings of many inference systems, such as natural deduction, sequent calculi, type systems, operational semantics, compilers, etc. The logical framework derives its expressive power from dependent types together with higherorder representation techniques which directly support common concepts in deductive systems such as variable binding, captureavoiding substitutions, parametric and hypothetical judgments and substitution properties. Th...