See this document in CiteSeerX!

Continuation Semantics in Typed Lambda-Calculi (1985)  (Make Corrections)  (66 citations)
Albert R. Meyer, Mitchell Wand
Proceedings 3rd Workshop on Logics of Programs, Brooklyn, NY, USA, 17--19 June 1985



  Home/Search   Context   Related

 
View or download:
neu.edu/pub/people/w...meyerwand85.ps
neu.edu/pub/people/w...meyerwand85.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  neu.edu/home/wand/pubs (more)
From:  neu.edu/pub/people/wand/papers...
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: . This paper reports preliminary work on the semantics of the continuation transform. Previous work on the semantics of continuations has concentrated on untyped lambda-calculi and has used primarily the mechanism of inclusive predicates. Such predicates are easy to understand on atomic values, but they become obscure on functional values. In the case of the typed lambda-calculus, we show that such predicates can be replaced by retractions. The main theorem states that the meaning of a closed... (Update)

Cited by:   More
Polymorphic Type Assignment and CPS Conversion - To Appear Acm   (Correct)
Relational Interpretations of Recursive Types in an.. - Lars Birkedal And (1997)   (Correct)
Controlling Effects - Filinski (1996)   (Correct)

Active bibliography (related documents):   More   All
0.2:   Formal Methods - Selected Historical References - Jones, McCauley (1992)   (Correct)
0.2:   Should a Function Continue? - Riecke (1989)   (Correct)
0.2:   The Formal Relationship between Direct and Continuation-Passing.. - Sabry (1994)   (Correct)

Similar documents based on text:   More   All
0.2:   An Improved Overlap Argument For On-Line Multiplication - Fischer, Meyer   (Correct)
0.1:   Measured Interference Effects of Magic WAND Devices on.. - Cec Deliverable   (Correct)
0.1:   Requirements Specification for Transport level QoS Control - Cec Deliverable   (Correct)

Related documents from co-citation:   More   All
37:   Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975
31:   Reasoning about programs in continuation-passing style - Sabry, Felleisen
31:   A formulae-as-types notion of control - Griffin - 1990

BibTeX entry:   (Update)

Albert R. Meyer and Mitchell Wand. Continuation semantics in typed lambda calculi (summary) . In Rohit Parikh, editor, Logics of Programs, volume 224 of Lecture Notes in Computer Science, pages 219--224. Springer-Verlag, 1985. http://citeseer.ist.psu.edu/meyer85continuation.html   More

@incollection{ meyer85continuation,
    author = "Albert R. Meyer and Mitchell Wand",
    title = "Continuation Semantics in Typed Lambda-Calculi",
    booktitle = "Proceedings 3rd Workshop on Logics of Programs, Brooklyn, {NY}, {USA}, 17--19 June 1985",
    volume = "193",
    publisher = "Springer-Verlag",
    address = "Berlin",
    editor = "R. Parikh",
    pages = "219--224",
    year = "1985",
    url = "citeseer.ist.psu.edu/meyer85continuation.html" }
Citations (may not include all citations):
430   The Structure and Interpretation of Computer Programs (context) - Abelson, Sussman - 1985
61   Continuations: A Mathematical Semantics for Handling Full Ju.. (context) - Strachey, Wadsworth - 1974
52   the Relation between Direct and Continuation Semantics (context) - Reynolds - 1974
21   Call-by-Name, Call-by-Value and the -Calculus (context) - Plotkin - 1975
10   The Congruence of Two Programming Language Definitions (context) - Stoy - 1981
9   Constructing Call-by-value Continuation Semantics (context) - Sethi, Tang - 1980
6   What Is a Model of the Lambda Calculus (context) - Meyer - 1982
6   A Types-as-Sets Semantics for Milner-style Polymorphism (context) - Wand - 1984
1   Proving Correctness of Data Representations (context) - Hoare - 1972



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.neu.edu/home/wand/pubs.html):   More
Compiler Correctness for Concurrent Languages - Gladstein, Wand (1994)   (Correct)
Untyped Lambda-Calculus with Input-Output - Tiuryn, Wand (1995)   (Correct)
Tracking Available Values for Lightweight Closures (Summary) - Paul Steckler (1994)   (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