Skip to main content
Journal Article

Demonstrating lambda calculus reduction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2566 LNCS 420-435
DOI: 10.1007/3-540-36377-7_19
24Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We describe lambda calculus reduction strategies, such as call-by-value, call-by-name, normal order, and applicative order, using big-step operational semantics. We show how to simply and efficiently trace such reductions, and use this in a web-based lambda calculus reducer available at http://www.dina.kvl.dk/ ~sestoft/lamreduce/. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Sestoft, P. (2002). Demonstrating lambda calculus reduction. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2566 LNCS, 420–435. https://doi.org/10.1007/3-540-36377-7_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free