Peter Selinger  Home/Search
Context Related
Links: ACM DBLP | umich.edu/pub/selinger/control.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umich.edu/~selinger/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper, we study the relationship between the call-by-name and call-by-value paradigms for Parigot's -calculus. The -calculus is an extension of the simply-typed lambda calculus with certain sequential control operators. We show that, in the presence of product and disjunction types, the call-by-name and call-by-value -calculi are isomorphic to each other, in the sense that there exist syntactic translations between them that preserve the operational semantics and that are mutually inverse... (Update)
Cited by: More
Constructing free Boolean categories - Lamarche, Straßburger (2005) (Correct)
Categorical Models Of First-Order Classical Proofs - McKinley (2006) (Correct)
Deep Inference Proof Theory Equals Categorical Proof Theory Minus .. - Hughes (2004) (Correct)
Active bibliography (related documents): More All
0.7: An Implementation of the Call-By-Name - Calculus Peter Selinger (Correct)
0.5: Sound and Complete Axiomatisations of Call-By-Value Control.. - Hofmann (1994) (Correct)
0.4: An Interpretation of the Second Order Sequent Calculus in the.. - Th Mar Ch (Correct)
Similar documents based on text: More All
0.3: Duality between Call-by-Name Recursion and Call-by-Value Iteration - Kakutani (2001) (Correct)
0.2: General Synthetic Domain Theory - A Logical Approach - Reus, Streicher (1997) (Correct)
0.1: The Groupoid Interpretation of Type Theory - Hofmann, Streicher (1996) (Correct)
Related documents from co-citation: More All
18: calculus: an algorithmic interpretation of classical natural deduction (context) - Parigot - 1992
9: Categorical Structure of Continuation Passing Style - Thielecke - 1997
9: Introduction to Higher Order Categorical Logic (context) - Lambek, Scott - 1986
BibTeX entry: (Update)
Peter Selinger. Control categories and duality: on the categorical semantics of the lambda-mu calculus. Presented at MFPS '98, London, 1999. http://citeseer.ist.psu.edu/selinger99control.html More
@article{ selinger01control,
author = "Peter Selinger",
title = "Control Categories and Duality: On the Categorical Semantics of the Lambda-Mu Calculus",
journal = "Mathematical Structures in Computer Science",
volume = "11",
number = "2",
pages = "207--260",
year = "2001",
url = "citeseer.ist.psu.edu/selinger99control.html" }
Citations (may not include all citations):359 An Introduction to Higher Order Categorical Logic (context) - Lambek, Scott - 1986
283 Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975 ACM
138 The revised report on the syntactic theories of sequential c.. - Felleisen, Hieb - 1992 ACM DBLP
134 calculus: An algorithmic interpretation of classical natural.. (context) - Parigot - 1992
110 A formulae-as-types notion of control - Griffin - 1990 DBLP
25 Natural associativity and commutativity (context) - Lane - 1963
24 A semantic view of classical proofs: Type-theoretic (context) - Ong - 1996
23 Categorical Structure of Continuation Passing Style - Thielecke - 1997
17 On Mac Lane's conditions for coherence of natural associativ.. (context) - Kelly - 1964
13 Premonoidal categories and notions of computation - Power, Robinson - 1997 ACM DBLP
11 continuation semantics and abstract machines (context) - Streicher, Reus - 1998
10 Department of Computer Science (context) - Moggi, monads et al. - 1988
9 Premonoidal categories and a graphical view of programs (context) - Jeffrey - 1997
8 Continuation models are universal for -calculus (context) - Hofmann, Streicher - 1997
7 the semantics of classical disjunction (context) - Pym, Ritter - 1998
5 Continuations semantics or expressing implication by negatio.. (context) - Lafont, Reus et al. - 1993
4 Direct models of the computational lambda-calculus (context) - Fuhrmann - 1999
2 An implementation of the call-by-name -calculus (context) - Selinger - 1998
2 Declarative continuations and monads (context) - Agapiev, Moggi - 1991
1 A Curry-Howard foundation for functional computation with co.. (context) - Categories, Ong et al. - 1997 ACM DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.lsa.umich.edu/~selinger/papers.html): More
The Lambda Calculus is Algebraic - Selinger (1996) (Correct)
Order-Incompleteness and Finite Lambda Models (Extended Abstract) - Selinger (Correct)
First-Order Axioms for Asynchrony - Selinger (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC