Back to Search

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
Collapse abstract

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Blum, W., & Ong, C. (2009). The Safe Lambda Calculus. Logic Methods in Computer Science, 5(1).

MLA Style

Blum, W., and C. Ong. “The Safe Lambda Calculus.” Logic Methods in Computer Science, vol. 5, no. 1, 2009.

Chicago Style

Blum, W, and C Ong. 2009. “The Safe Lambda Calculus.” Logic Methods in Computer Science 5 (1).
Tweet
Print

Access Document

Publisher copy:: 10.2168/LMCS-5(1:3)2009

Authors

+ Blum, W More by this author

Role:

Author

+ Ong, C More by this author

Role:

Author

Bibliographic Details

Journal:: Logic Methods in Computer Science
Volume:: 5
Issue:: 1
Publication date:: 2009-01-01
DOI:: 10.2168/LMCS-5(1:3)2009

Item Description

UUID:: uuid:24fc5271-eb2f-4180-be9b-2a79c9609a88
Local pid:: cs:2957
Deposit date:: 2015-03-31

Terms of use

Copyright date:: 2009

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Metrics

Views and Downloads

About 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