Binders Unbound
Implementors of compilers, program refactorers, theorem provers, proof checkers, and other systems that manipulate syntax know that dealing with name binding is difficult to do well. Operations such as -equivalence and capture-avoiding substitution seem simple, yet subtle bugs often go undetected. F...
Main Authors: | , , |
---|---|
Format: | Conference Object |
Language: | unknown |
Published: |
2011
|
Subjects: | |
Online Access: | https://repository.upenn.edu/handle/20.500.14332/49803 https://hdl.handle.net/20.500.14332/49803 |