Lars Birkedal, Robert Harper  Home/Search
Context Related
| cmu.edu/afs/cs/user/birk...tacs97.ps.gz cmu.edu/afs/cs/user/rwh/publi...tacs.ps cmu.edu/~rwh/papers/relations...tacs.ps 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: cmu.edu/afs/cs/user/birkedal/p... (more) From: cmu.edu/~rwh/papers/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Relational interpretations of type systems are a useful tool for establishing properties of programming languages. For languages with recursive types the existence of a relational interpretation is often difficult to establish. The most well-known approach is to pass to a domaintheoretic model of the language, using the structure of the domain to define a suitable system of relations. Here we study the construction of relational interpretations for an ML-like language with recursive ... (Update)
Context of citations to this paper: More
.... some other approach in order to avoid a circular definition; here syntactic versions of the construction of recursively defined domains [4] may be of assistance. A more subtle problem is that some of our definitions (for example the notion of extension of state relations in...
Cited by: More
GDP Festschrift ENTCS, to appear Syntactic Logical.. - Robert Harper Computer (Correct)
Step-Indexed Syntactic Logical Relations for Recursive and.. - Ahmed (2006) (Correct)
Type Refinements - Harper, Pfenning (2001) (Correct)
Similar documents (at the sentence level):
46.1%: Relational Interpretations of Recursive Types in an.. - Birkedal, Harper (1997) (Correct)
39.3%: Relational Interpretations of Recursive Types in an.. - Cmu-Cs- School Of (1998) (Correct)
Active bibliography (related documents): More All
0.2: Type Theory for Programming Languages - Harper (1994) (Correct)
0.1: Categorical Structure of Continuation Passing Style - Thielecke (1997) (Correct)
0.1: Semantics of Memory Management for Polymorphic Languages - Morrisett, Harper (1997) (Correct)
Similar documents based on text: More All
0.2: A Domain-Theoretic Banach-Alaoglu Theorem - Gordon Plotkin School (Correct)
0.1: Operational Versus Denotational Methods in the Semantics of Higher .. - Pitts (1998) (Correct)
0.1: A Region Inference Algorithm - Tofte, Birkedal (1998) (Correct)
Related documents from co-citation: More All
8: The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
6: Relational properties of domains - Pitts - 1996
6: Operational reasoning for functions with local state - Pitts, Stark - 1996
BibTeX entry: (Update)
Lars Birkedal and Robert Harper. Relational interpretations of recursive types in an operational setting. In Theoretical Aspects of Computer Software, 1997. http://citeseer.ist.psu.edu/article/birkedal97relational.html More
@inproceedings{ birkedal97relational,
author = "Lars Birkedal and Robert Harper",
title = "Relational Interpretations of Recursive Types in an operational Setting (Summary)",
booktitle = "Theoretical Aspects of Computer Software",
pages = "458-490",
year = "1997",
url = "citeseer.ist.psu.edu/article/birkedal97relational.html" }
Citations (may not include all citations):1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
306 LCF considered as a programming language (context) - Plotkin - 1977
283 Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975
254 Revised 4 report on the algorithmic language Scheme - Clinger, Rees - 1991
229 Foundations for Programming Languages (context) - Mitchell - 1996
152 Semantics of Programming Languages (context) - Gunter - 1992
139 Type systems for programming languages (context) - Mitchell - 1990
118 Lambda Calculus Models of Programming Languages (context) - Morris - 1968
94 Equality in lazy computation systems - Howe - 1989
69 Relational properties of domains - Pitts - 1996
69 Typing first-class continuations in ML - Duba, Harper et al. - 1991
66 Continuation semantics in typed lambda calculi - Meyer, Wand - 1985
58 Algebraically complete categories (context) - Freyd - 1990
52 the relation between direct and continuation semantics (context) - Reynolds - 1974
48 Operationally-based theories of program equivalence - Pitts - 1995
46 Recursive types reduced to inductive types (context) - Freyd - 1990
36 Remarks on algebraically compact categories (context) - Freyd - 1991
35 Typing first-class continuations in ML - Harper, Duba et al. - 1993
28 From operational semantics to domain theory - Mason, Smith et al. - 1995
22 Dynamic typing in a statically typed language (context) - Abadi, Cardelli et al. - 1991
20 School of Computer Science (context) - Filinski, CMU--CS-- - 1996
18 Relational interpretations of recursive types in an operatio.. - Birkedal, Harper
17 LISP and Symbolic Computation (context) - Fischer - 1993
11 Relational reasoning about contexts - Lassen
10 Elimination des Coupures dans l'Arithm'etique d'Ordre Sup'er.. (context) - Girard, et - 1972
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/afs/cs/user/birkedal/pub/): More
Type Theory via Exact Categories (Extended Abstract) - Birkedal, Carboni.. (1998) (Correct)
Developing Theories of Types and Computability - Birkedal (1998) (Correct)
Equilogical Spaces - Bauer, Birkedal, Scott (1998) (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