Elf: a language for logic definition and verified metaprogramming
Proceedings of the Fourth Annual Symposium on Logic in computer science
A calculus of mobile processes, II
Information and Computation
Information and Computation
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
&pgr;-calculus in (Co)inductive-type theory
Theoretical Computer Science - Special issues on models and paradigms for concurrency
Reasoning with higher-order abstract syntax in a logical framework
ACM Transactions on Computational Logic (TOCL)
A mechanized theory of the &pi-calculus in Hol
Nordic Journal of Computing
Higher-Order Abstract Syntax with Induction in Coq
LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
Higher-Order Abstract Syntax in Coq
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Five Axioms of Alpha-Conversion
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Inductive Datatypes in HOL - Lessons Learned in Formal-Logic Engineering
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
A pi-calculus Process Semantics of Concurrent Idealised ALGOL
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
A Fixedpoint Approach to Implementing (Co)Inductive Definitions
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
A Full Formalisation of pi-Calculus Theory in the Calculus of Constructions
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Semantical Analysis of Higher-Order Abstract Syntax
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
25 years of formal proof cultures: some problems, some philosophy, bright future
Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice
| Hi-index | 0.00 |
Higher-order abstract syntax is a natural way to formalize programming languages with binders, like the π-calculus, because α-conversion, instantiations and capture avoidance are delegated to the meta-level of the provers, making tedious substitutions superfluous. However, such formalizations usually lack structural induction, which makes syntax-analysis impossible. Moreover, when applied in logical frameworks with object-logics, like Isabelle/HOL or standard extensions of Coq, exotic terms can be defined, for which important syntactic properties become invalid. The paper presents a formalization of the π-calculus in Isabelle/HOL, using well-formedness predicates which both eliminate exotic terms and yield structural induction. These induction-principles are then used to derive the Theory of Contexts fully within the mechanization.