Smalltalk-80: the language and its implementation
Smalltalk-80: the language and its implementation
OOPSLA '87 Conference proceedings on Object-oriented programming systems, languages and applications
Object-oriented programming in scheme
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The annotated C++ reference manual
The annotated C++ reference manual
Toward a typed foundation for method specialization and inheritance
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the fifth international conference on Mathematical foundations of programming semantics
Eiffel: the language
T: a dialect of Lisp or LAMBDA: The ultimate software tool
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
A lambda calculus of objects with self-inflicted extension
Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
A Control-Flow Analysis for a Calculus of Concurrent Objects
IEEE Transactions on Software Engineering
An efficient class and object encoding
OOPSLA '00 Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Combining subsumption and binary methods: an object calculus with views
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
More dynamic object reclassification: Fickle∥
ACM Transactions on Programming Languages and Systems (TOPLAS)
Typed interpretations of extensible objects
ACM Transactions on Computational Logic (TOCL)
UPSILON: universal programming system with incomplete lazy object notation
Fundamenta Informaticae
Type inference with simple selftypes is NP-complete
Nordic Journal of Computing
PolyTOIL: A type-safe polymorphic object-oriented language
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Core Calculus of Classes and Mixins
ECOOP '99 Proceedings of the 13th European Conference on Object-Oriented Programming
Fickle: Dynamic Object Re-classification
ECOOP '01 Proceedings of the 15th European Conference on Object-Oriented Programming
Subtyping and Matching for Mobile Objects
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Bounded Polymorphism for Extensible Objects
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
A Framework for Defining Object-Calculi
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Interpretations of Extensible Objects and Types
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Equational Reasoning for Linking with First-Class Primitive Modules
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
A specification logic for concurrent object-oriented programming
Mathematical Structures in Computer Science
Reasoning on an imperative object-based calculus in Higher Order Abstract Syntax
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Extensible objects without labels
ACM Transactions on Programming Languages and Systems (TOPLAS)
A core calculus of mixins and incomplete objects
OOPSLA '04 Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
Proceedings of the 2005 ACM symposium on Applied computing
A historic functional and object-oriented calculus
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Enhancing program verifications by restricting object types
Proceedings of the 2006 ACM symposium on Applied computing
Addressed term rewriting systems: application to a typed object calculus
Mathematical Structures in Computer Science
The movable point problem and its resolution in object type graphs
Proceedings of the 43rd annual Southeast regional conference - Volume 2
Abstract Interpretation Against Races
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Abstract Interpretation of an Object Calculus for Synchronization Optimizations
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Proceedings of the third ACM SIGPLAN conference on History of programming languages
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts
Journal of Automated Reasoning
Extending FeatherTrait Java with Interfaces
Theoretical Computer Science
Type safe dynamic object delegation in class-based languages
Proceedings of the 6th international symposium on Principles and practice of programming in Java
An Operational Semantics for JavaScript
APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
Alias Types and Effects for "Environment-aware" Computations
Fundamenta Informaticae
Delegation: a language facility for dynamic software adaptation
ACM SIGSOFT Software Engineering Notes
Semantic predicate types and approximation for class-based object oriented programming
Proceedings of the 11th International Workshop on Formal Techniques for Java-like Programs
Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Difunctorial Semantics of Object Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Characterizing convergent terms in object calculi via intersection types
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Big-step Operational Semantics Revisited
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
Delegation by object composition
Science of Computer Programming
Approximation semantics and expressive predicate assignment for object-oriented programming
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Cloudscape: language support to coordinate and control distributed applications in the cloud
Proceedings of the compilation of the co-located workshops on DSM'11, TMC'11, AGERE!'11, AOOPES'11, NEAT'11, & VMIL'11
Safe object composition in the presence of subtyping
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Prototypes with multiple dispatch: an expressive and dynamic object model
ECOOP'05 Proceedings of the 19th European conference on Object-Oriented Programming
Towards type inference for javascript
ECOOP'05 Proceedings of the 19th European conference on Object-Oriented Programming
Alias Types and Effects for "Environment-aware" Computations
Fundamenta Informaticae
Abstract Interpretation of an Object Calculus for Synchronization Optimizations
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Abstract Interpretation Against Races
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
UPSILON: Universal Programming System with Incomplete Lazy Object Notation
Fundamenta Informaticae
A Subtyping for Extensible, Incomplete Objects
Fundamenta Informaticae
FJMIP: a calculus for a modular object initialization
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Semantic Types and Approximation for Featherweight Java
Theoretical Computer Science
| Hi-index | 0.00 |
This paper presents an untyped lambda calculus, extended with object primitives that reflect the capabilities of so-called delegation-based object-oriented languages. A type inference system allows static detection of errors, such as message not understood, while at the same time allowing the type of an inherited method to be specialized to the type of the inheriting object. Type soundness is proved using operational semantics and examples illustrating the expressiveness of the pure calculus are presented.