Journal article icon

Journal article

The Safe Lambda Calculus

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 setting of the simply-typed lambda calculus. In contrast to the original definition of safety, our calculus does not constrain types (to be homogeneous). We show that in the safe lambda calculus, ther...

Expand abstract

Actions


Access Document


Publisher copy:
10.2168/LMCS-5(1:3)2009
Journal:
Logic Methods in Computer Science More from this journal
Volume:
5
Issue:
1
Publication date:
2009-01-01
DOI:
UUID:
uuid:24fc5271-eb2f-4180-be9b-2a79c9609a88
Local pid:
cs:2957
Deposit date:
2015-03-31

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP