See this document in CiteSeerX!

Sequential Functions on Indexed Domains and Full Abstraction for a Sub-language of PCF (1994)  (Make Corrections)  (2 citations)
Stephen Brookes, Shai Geva
MFPS



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
cmu.edu/usr/anon/199...CMUCS93163.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cmu.edu/People/clamen/repo...1993 (more)
(Enter author homepages)

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

Abstract: ion for a Sub-language of PCF Stephen Brookes Shai Geva April 1993 CMU-CS-93-163 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 To appear in Proceedings of Mathematical Foundations of Programming Semantics, New Orleans, 1993 (Springer Verlag Lecture Notes in Computer Science). Abstract We present a general semantic framework of sequential functions on domains equipped with a parameterized notion of incremental sequential computation. Under the simplifying... (Update)

Context of citations to this paper:   More

.... of finding something similar for PCF is one reason why further developments along the lines of, e.g. Bucciarelli and Erhardt, 1991; Brookes and Geva, 1994) continue to hold interest. Acknowledgements: We thank Gerard Berry, Achim Jung, Albert Meyer, Gordon Plotkin, Kurt Sieber...

...stability conditions on functions to arrive at a model that is fully abstract for the first order fragment of PCF. Brookes and Geva [BG93] also achieve full abstraction for a fragment of PCF using domain theoretic ideas. Recently, Winskel [Win94] refined Berry s bidomains to...

Cited by:   More
Domains and Denotational Semantics: History, Accomplishments and.. - (Ed.) (1996)   (Correct)
Kripke Logical Relations and PCF - O'Hearn, Riecke (1995)   (Correct)

Active bibliography (related documents):   More   All
0.8:   Correspondence between operational and denotational semantics: the.. - Ong (1995)   (Correct)
0.2:   SPCF: Its Model, Calculus, and Computational Power.. - Kanneganti.. (1992)   (Correct)
0.2:   Stable and Sequential Functions on Scott Domains - Brookes, Geva (1992)   (Correct)

Similar documents based on text:   More   All
0.4:   Projecting Sequential Algorithms on Strongly Stable Functions - Ehrhard (1993)   (Correct)
0.4:   Sequentiality in an Extensional Framework - Bucciarelli, Ehrhard (1993)   (Correct)
0.2:   A New Direction for Sublanguage N.L.P. - Sekine (1994)   (Correct)

Related documents from co-citation:   More   All
2:   New steps towards full abstraction for local variables (context) - Sieber - 1993
2:   Type Systems for Programming Languages (context) - Mitchell - 1990
2:   Dialogue games and innocent strategies: An approach to - Hyland, Ong - 1993

BibTeX entry:   (Update)

Brookes, S. and Geva, S. (1994). Sequential functions on indexed domains and full abstraction for a sublanguage of PCF. In Brookes, S. et al., editors, Proceedings of the 8th Annual Symposium on Mathematical Foundations of Program Semantics, volume 802 of Lecture Notes in Computer Science, pages 320--332, New Orleans. Springer-Verlag. http://citeseer.ist.psu.edu/brookes94sequential.html   More

@inproceedings{ brookes93sequential,
    author = "Stephen D. Brookes and Shai Geva",
    title = "Sequential Functions on Indexed Domains and Full Abstraction for a Sub-Language of {PCF}",
    booktitle = "{MFPS}",
    pages = "320-332",
    year = "1993",
    url = "citeseer.ist.psu.edu/brookes94sequential.html" }
Citations (may not include all citations):
306   LCF considered as a programming language (context) - Plotkin - 1977  DBLP
245   A Compendium of Continuous Lattices (context) - Gierz, Hoffman et al. - 1980
72   Fully abstract models of typed lambda-calculi (context) - Milner - 1977
61   Sequential algorithms on concrete data structures (context) - Berry, Curien - 1982  DBLP
38   Full abstraction for sequential languages: the state of the .. (context) - Berry, Curien et al. - 1985
29   Theory and practice of sequential algorithms: the kernel of .. (context) - Berry, Curien - 1985
27   Stable models of typed -calculi (context) - Berry - 1978
19   Sequentiality and strong stability (context) - Bucciarelli, Ehrhard - 1991  DBLP
18   Observable sequentiality and full abstraction - Cartwright, Felleisen - 1992
15   Proof techniques for recursive programs (context) - Vuillemin - 1973
13   Full Abstraction and Semantic Equivalence (context) - Mulmuley - 1987  ACM
11   Progress in Theoretical Computer Science (context) - Zhang, Domains - 1991
9   Observable algorithms on concrete data structures (context) - Curien - 1992  DBLP
2   Stable and sequential functions on Scott domains - Brookes, Geva - 1992  ACM

Documents on the same site (http://www.cs.cmu.edu/People/clamen/reports/1993.html):   More
Visual Representations as Feedback in a Programmable Visual Shell - Modugno, Myers (1993)   (Correct)
Deferred Compilation: The Automation of Run-Time Code Generation - Leone, Lee (1993)   (Correct)
Fail-safe PVM: A portable package for distributed programming with .. - Leon (1993)   (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