• Journal of KIISE:Software and Applications
• /
• v.35 no.12
• /
• pp.800-807
• /
• 2008

We introduce some well-known approaches to formalization and automatization of the meta-theory of a programming language with binders. They represent the trends in POPLmark Challenge. We demonstrate some characteristics of each approach by showing how to formalize some basic notations and concepts of Lambda-calculus using the proof assistant Coq.