Inheritance in smalltalk-80: a denotational definition
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Programming with intersection types and bounded polymorphism
Programming with intersection types and bounded polymorphism
Operational, denotational and logical descriptions: a case study
Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
Type inference, abstract interpretation and strictness analysis
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Full abstraction in the lazy lambda calculus
Information and Computation
Lambda-calculi for (strict) parallel functions
Information and Computation
Bisimilarity for a first-order calculus of objects with subtyping
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An interpretation of objects and object types
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Foundations of programming languages
Foundations of programming languages
A Filter Model for Concurrent $\lambda$-Calculus
SIAM Journal on Computing
Completeness of intersection and union type assignment systems for call-by-value λ-models
Theoretical Computer Science - Special issue on theories of types and proofs
A Theory of Objects
A lambda calculus of objects and method specialization
Nordic Journal of Computing
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
The Coherence of Languages with Intersection Types
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Simple, Efficient Object Encoding using Intersection Types
Simple, Efficient Object Encoding using Intersection Types
A compositional logic for polymorphic higher-order functions
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Type Assignement for Mobile Objects
Electronic Notes in Theoretical Computer Science (ENTCS)
On normalization by evaluation for object calculi
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
Subtyping object and recursive types logically
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
| Hi-index | 0.00 |
We give a simple characterization of convergent terms in Abadi and Cardelli untyped Object Calculus (ς-calculus) via intersection types. We consider a λ-calculus with records and its intersection type assignment system. We prove that convergent λ-terms are characterized by their types. The characterization is then inherited by the object calculus via self-application interpretation.