A short proof of the lexical addressing algorithm

This publication has 7 references indexed in Scilit:

• Conditional lambda-theories and the verification of static properties of programs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Higher-order abstract syntax
  Published by Association for Computing Machinery (ACM) ,1988
• The scheme 311 compiler an exercise in denotational semantics
  Published by Association for Computing Machinery (ACM) ,1984
• Deriving Target Code as a Representation of Continuation Semantics
  ACM Transactions on Programming Languages and Systems, 1982
• Call-by-name, call-by-value and the λ-calculus
  Theoretical Computer Science, 1975
• Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
  Indagationes Mathematicae, 1972
• A formulation of the simple theory of types
  The Journal of Symbolic Logic, 1940