G.M. Bierman, A.M. Pitts, C.V. Russo  Home/Search
Context
Related
| cl.cam.ac.uk/papers/ap/opeplp.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: cl.cam.ac.uk/~amp12/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Plotkin has advocated the combination of linear lambda calculus, polymorphism and fixed point recursion as an expressive semantic metalanguage. We study its expressive power from an operational point of view. We show that the naturally call-by-value operators of linear lambda calculus can be given a call-by-name semantics without affecting termination at exponential types and hence without affecting ground contextual equivalence. This result is used to prove properties of a logical relation... (Update)
Active bibliography (related documents): More All
0.3: Erratic Fudgets: A Semantic Theory for an Embedded.. - Moran, Sands, Carlsson (1999) (Correct)
0.3: An Operational Theory for a Region Calculus - Helsen (2001) (Correct)
0.2: Improvement in a Lazy Context: An Operational Theory for.. - Moran, Sands (1999) (Correct)
Similar documents based on text: More All
0.4: MJ: An imperative core calculus for Java and Java with.. - Bierman, Parkinson, Pitts (2003) (Correct)
0.4: Logical Relations for Names - Zhang (2002) (Correct)
0.3: Operational Semantics and Program Equivalence - Pitts (2000) (Correct)
BibTeX entry: (Update)
@misc{ bierman-operational,
author = "G.M. Bierman and A.M. Pitts and C.V. Russo",
title = "Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with
Recursion",
url = "citeseer.ist.psu.edu/341319.html" }
Citations (may not include all citations):306 LCF considered as a programming language (context) - Plotkin - 1977
233 Computational interpretations of linear logic - Abramsky - 1993
147 abstraction and parametric polymorphism (context) - Reynolds - 1983
143 Theorems for free - Wadler - 1989
117 Semantic domains - Gunter, Scott - 1990
114 A natural semantics for lazy evaluation - Launchbury - 1993
75 Proving congruence of bisimulation in functional programming.. - Howe - 1996
73 Denotational semantics (context) - Mosses - 1990
51 Deriving a lazy abstract machine - Sestoft - 1997
38 Department of Computer Science (context) - Barber, Theories et al. - 1997
26 Improvement in a lazy context: An operational theory for cal.. - Moran, Sands - 1999
26 From Algol to polymorphic linear lambdacalculus - O'Hearn, Reynolds - 2000
25 Operational interpretations of linear logic - Turner, Wadler - 1999
23 Mathematical Structures in Computer Science (context) - Pitts, operational - 2000
17 Some notes on inductive and co-inductive techniques in the s.. (context) - Pitts - 1994
13 Metalanguages and applications - Moggi - 1997
12 Lisp and Symbolic Computation (context) - Jones, Launchbury et al. - 1995
12 An axiomatization of computationally adequate domain theoret.. (context) - Fiore, Plotkin - 1994
11 Relational reasoning about contexts - Lassen - 1998
5 How linear is Howe (context) - Crole - 1996
5 Equivalence in functional languages with e ects (context) - Mason, Talcott - 1991
4 Second order type theory and recursion (context) - Plotkin - 1993
1 Pitts and Russo (context) - Moggi, computation et al. - 1991
1 Program equivalence in a linear functional language (context) - Bierman - 2000
1 An operational semantics of sharing in lazy evaluation (context) - Seaman, Iyer - 1996
Documents on the same site (http://www.cl.cam.ac.uk/~amp12/papers/): More
Abstract Syntax with Variable Binding - Gabbay, al. (1999) (Correct)
On the Observable Properties of Higher Order Functions that.. - Pitts, Stark (1993) (Correct)
A Metalanguage for Programming with Bound Names Modulo Renaming - Pitts, Gabbay (2000) (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