Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
421899 | Electronic Notes in Theoretical Computer Science | 2009 | 19 Pages |
Abstract
We study normalization in the simply typed lambda-mu calculus, an extension of lambda calculus with control flow operators. Using an enriched version of the Yoneda embedding, we obtain a categorical normal form function for simply typed lambda-mu terms, which gives a special kind of a call-by-name denotational semantics particularly useful for deciding equalities in the lambda-mu calculus.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics