Daniel Dougherty, Frédéric Lang, Pierre Lescanne, Luigi Liquori, Kristoffer Rose  Home/Search
Context
Related
| enslyon.fr/pub/LIP/Ra...RR199954.ps.Z 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: enslyon.fr/~krisr...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In a previous paper we have outlined a framework (or a generic object-calculus) called Obj +a , for modeling object calculi. In this one, we would like to describe the foundations of Obj +a . This framework is essentially a detailed formal operational semantics of object based languages, in the style of the Lambda Calculus of Objects. As a formalism for speci cation Obj +a is arranged in modules, permitting a natural classi cation of many object-based calculi according to their... (Update)
Similar documents (at the sentence level):
54.0%: A Generic Object-Calculus Based on Addressed Term.. - Dougherty, Lang.. (2001) (Correct)
Active bibliography (related documents): More All
0.7: A Framework for Defining Object-Calculi (Extended Abstract) - Lang, al. (1998) (Correct)
0.5: A Framework for Defining Object-Calculi - Lang, Lescanne, Liquori (1999) (Correct)
0.3: Addressed Term Rewriting Systems - Lang, Dougherty, Lescanne, Rose (1999) (Correct)
Similar documents based on text: More All
0.8: Using Ambients to Control Resources - Teller, Zimmer, Hirschkopf (2002) (Correct)
0.4: Cv - Liquori (Correct)
0.3: Bounded Polymorphism for Extensible Objects - Liquori (1999) (Correct)
BibTeX entry: (Update)
@misc{ dougherty-generic,
author = "Daniel Dougherty and Frédéric Lang and Pierre Lescanne and Luigi Liquori
and Kristoffer Rose",
title = "A Generic Object-Calculus Based on Addressed Term Rewriting Systems",
url = "citeseer.ist.psu.edu/article/dougherty99generic.html" }
Citations (may not include all citations):906 A Structural Approach to Operational Semantics - Plotkin - 1981
729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
474 Term Rewriting Systems - Klop - 1990
359 The Implementation of Functional Programming Languages (context) - Peyton-Jones - 1987
353 Term Rewriting and All That (context) - Baader, Nipkow - 1998
346 Denotational Semantics: The Scott-Strachey Approach to Progr.. (context) - Stoy - 1977
306 Self: The power of simplicity (context) - Ungar, Smith - 1987
264 A language with distributed scope - Cardelli - 1995
218 The mechanical evaluation of expressions (context) - Landin - 1964
174 Springer-Verlag (context) - Abadi, Cardelli et al. - 1996
143 A new implementation technique for applicative languages (context) - Turner - 1979
138 Functional Programming and Parallel Graph Rewriting (context) - Plasmeijer, van Eekelen - 1993
138 The revised report on the syntactic theories of sequential c.. - Felleisen, Hieb - 1992
138 Type inference for polymorphic references (context) - Tofte - 1990
137 Journal of Functional Programming (context) - Abadi, Cardelli et al. - 1991
121 Handbook of Theoretical Computer Science (context) - Dershowitz, Jouannaud - 1990
103 The Denition of Standard ML (context) - Milner, Tofte et al. - 1990
102 Term Graph Rewriting (context) - Barendregt, Van Eekelen et al. - 1987
84 The next 700 programming languages (context) - Landin - 1966
72 Semantics and pragmatics of the lambda calculus (context) - Wadsworth - 1971
63 A lambda calculus of objects and method specialization - Fisher, Honsell et al. - 1994
63 Optimal reductions in the lambda-calculus (context) - evy - 1980
50 Department of Computer Science and Engineering (context) - Chambers, language et al. - 1993
35 a journey through calculi of explicit substitutions - Lescanne, to - 1994
34 Optimal Derivations in Weak Lambda Calculi and in Orthogonal.. - Maranget - 1992
33 purely functional language (context) - Peterson, Hammond et al. - 1997
30 A syntactic theory of sequential state (context) - Felleisen, Friedman - 1989
29 Term graph rewriting - Plump - 1999
27 Preservation of strong normalisation in named lambda calculi.. - Bloo, Rose - 1995
21 Operational Reduction Models for Functional Programming Lang.. - Rose - 1996
19 First-Order Calculus with Object Extension (context) - Bono, Fisher - 1998
19 Modeling Sharing and Recursion for Weak Reduction Strategies.. - -A, Rose et al. - 1996
8 Les calculs de substitutions explicites comme fondement de l.. (context) - -A - 1997
6 a prototype-based object-oriented language based on concaten.. (context) - Tailvalsaari - 1992
4 A framework for dening object-calculi (context) - Lang, Lescanne et al. - 1999
4 Laboratoire de l'informatique du parallelisme (context) - Lang, Lescanne et al. - 1998
4 Laboratoire de l'informatique du parallelisme (context) - Lang, Dougherty et al. - 1999
4 A Lambda Calculus of Objects with Self-in icted Extension (context) - Di Gianantonio, Honsell et al. - 1998
3 A compiler for lazy ML (context) - Augustson - 1984
3 Institut National de Recherche en Informatique et en Automat.. (context) - Kahn, Technical - 1987
Documents on the same site (http://www.ens-lyon.fr/~krisrose/publications.html): More
Type-Directed Partial Evaluation in Haskell - Kristoffer Rose Ens-Lyon (Correct)
Higher-Order Rewriting and Partial Evaluation - Danvy, Rose (1998) (Correct)
Combinatory Reduction Systems with Explicit Substitution that.. - Bloo, Rose (1996) (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