The Safe Lambda Calculus
Published in Logical Methods in Computer Science • Feb 19, 2009
Authors:,
William Blum
C.-H. Luke Ong
Abstract
Safety is a syntactic condition of higher-order grammars that constrains occurrences of variables in the production rules according to their type-theoretic order. In this paper, we introduce the safe lambda calculus, which is obtained by transposing (and generalizing) the safety condition to the set...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!