See this document in CiteSeerX!

Labelled Reductions, Runtime Errors, and Operational Subsumption (1997)  (Make Corrections)  
Laurent Dami
Automata, Languages and Programming



  Home/Search   Context   Related

 
View or download:
cui.unige.ch/PUBLIC/dami/subs.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  fermivista.math.ju...cui.unige.ch (more)
(Enter author homepages)

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

Abstract: When combining modules it may be the case that the assembly is partially incorrect (errorprone) , but nevertheless useful in some contexts. However usual type system will reject such assemblies as soon as they detect a potential error. We propose a more liberal approach: an error in a software configuration is tolerated as long as there are contexts which can use it without reaching the error; as a result, software reusability is improved. We introduce a general framework which defines in a... (Update)

Similar documents (at the sentence level):
21.3%:   Labelled Reductions, Runtime Errors, and Operational Subsumption - Dami   (Correct)

Active bibliography (related documents):   More   All
0.7:   Functional Programming with Dynamic Binding - Dami (1996)   (Correct)
0.6:   Operational Subsumption, an Ideal Model of Subtyping - Dami (1998)   (Correct)
0.4:   Type-Secure Meta-Programming - Christopher Bentley Dornan (1998)   (Correct)

Similar documents based on text:   More   All
0.0:   Between Liberalism and Democracy - Samet, Schmeidler (2000)   (Correct)
0.0:   Temporal Scripting using TEMPO - Dami, Fiume, Nierstrasz, Tsichritzis (1988)   (Correct)
0.0:   Higher-Order Functional Composition in Visual Form - Dami, Vallet (1996)   (Correct)

BibTeX entry:   (Update)

@inproceedings{ dami97labelled,
    author = "Laurent Dami",
    title = "Labelled Reductions, Runtime Errors and Operational Subsumption",
    booktitle = "Automata, Languages and Programming",
    pages = "782-793",
    year = "1997",
    url = "citeseer.ist.psu.edu/dami97labelled.html" }
Citations (may not include all citations):
283   Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975
214   An Ideal Model for Recursive Polymorphic Types (context) - MacQueen, Plotkin et al. - 1986
162   Data types as lattices (context) - Scott - 1976
94   Equality in lazy computation systems - Howe - 1989
92   Monographs in Computer Science (context) - Abadi, Cardelli et al. - 1996
88   Typechecking records and variants in a natural extension of .. (context) - emy
81   Information and Computation (context) - Bruce, Longo et al. - 1990
71   Operations on Records - Cardelli, Mitchell - 1991
67   Inheritance as Implicit Coercion (context) - Breazu-Tannen, Coquand et al. - 1991
63   The Java TM Language Specification (context) - Gosling, Joy et al. - 1996
48   Studies in Logic and the Foundations of Mathematics (context) - Barendregt, its et al. - 1984
47   Two extensions of Curry's Type Inference System (context) - Cardone, Coppo - 1990
35   An Approximation Theorem for Topological Lambda Models and t.. (context) - Honsell, della - 1992
34   Theoretical aspects of object-oriented programming: types (context) - Gunter, Mitchell - 1994
28   From Operational Semantics to Domain Theory - Mason, Smith et al. - 1996
24   Bisimilarity for a First-Order Calculus of Objects with Subt.. - Gordon, Rees - 1996
23   Typing Record Concatenation for Free - emy - 1992
22   A Lambda-Calculus for Dynamic Binding - Dami - 1997
21   A Theory of Binding Structures and Applications to Rewriting - Talcott - 1993
20   Full Abstraction and the Context Lemma - Jim, Meyer - 1996
19   Information and Computation (context) - Boudol, for et al. - 1994
12   Faithful Ideal Models for Recursive Polymorphic Types - Abadi, Pierce et al. - 1991
10   Semantic Techniques for Deriving Coinductive Characterizatio.. - Lenisa - 1997
8   ACM SIGPLAN Notices (context) - Hudak, Report et al. - 1992
5   Flat Lattice Models of Typed -calculus (context) - Bloom, Be - 1990
5   and Operational Subsumption (context) - Dami, Runtime - 1997
2   Full Abstraction in the Lazy Lambda Calculus (context) - SamsonAbramsky - 1993
2   Vincent van Oostrom and Femke van Raamsdonk (context) - Klop - 1993
1   Vincent van Oostrom and Fer-Jan de Vries (context) - Kennaway - 1996
1   Runtime Errors and Operational Subsumption (context) - Plotkin, as et al. - 1978
1   A Comparison of Record Calculi (context) - Dami - 1997
1   Pierre-Louis Curien and Matthias Felleisen (context) - Cartwright - 1994

Documents on the same site (http://fermivista.math.jussieu.fr/ftp/cui.unige.ch.html):   More
Watermarking Digital Images for Copyright Protection - Ruanaidh, Dowling, Boland (1996)   (Correct)
Towards a New Massively Parallel Computational Model for.. - Hölldobler, Kalinke   (Correct)
A Lambda-Calculus for Dynamic Binding - Dami (1997)   (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