The Experts below are selected from a list of 285 Experts worldwide ranked by ideXlab platform
Gavin Bierman - One of the best experts on this subject based on the ideXlab platform.
-
Aliasing in Object-Oriented Programming - Separation logic for Object-Oriented Programming
Lecture Notes in Computer Science, 2013Co-Authors: Matthew Parkinson, Gavin BiermanAbstract:In this article we propose techniques based on separation logic to reason about Object-Oriented programs. This leads to a modular proof system that can deal with features considered core to Object-Oriented Programming, including Object encapsulation, subclassing, inheritance, and dynamic dispatch.
Richard Jones - One of the best experts on this subject based on the ideXlab platform.
-
ECOOP 2014 – Object-Oriented Programming - ECOOP 2014 – Object-Oriented Programming
Lecture Notes in Computer Science, 2014Co-Authors: Richard JonesAbstract:Structural subtyping is an important notion for effective static type analysis; it can be defined either axiomatically by a collection of subtyping rules, or by means of set inclusion between type interpretations, following the semantic subtyping approach, which is more intuitive, and allows simpler proofs of the expected properties of the subtyping relation. In Object-Oriented Programming, recursive types typically correspond to inductively defined data structures, and subtyping is defined axiomatically; however, in Object-Oriented languages Objects can also be cyclic, but inductive types cannot represent them as precisely as happens for coinductive types. We study semantic subtyping between coinductive types with records and unions, which are particularly interesting for Object-Oriented Programming, show cases where it allows more precise type analysis, and develop a sound and complete effective algorithm for deciding it. To our knowledge, this is the first proposal for a sound and complete algorithm for semantic subtyping between coinductive types
Matthew Parkinson - One of the best experts on this subject based on the ideXlab platform.
-
Aliasing in Object-Oriented Programming - Separation logic for Object-Oriented Programming
Lecture Notes in Computer Science, 2013Co-Authors: Matthew Parkinson, Gavin BiermanAbstract:In this article we propose techniques based on separation logic to reason about Object-Oriented programs. This leads to a modular proof system that can deal with features considered core to Object-Oriented Programming, including Object encapsulation, subclassing, inheritance, and dynamic dispatch.
Herbert Kuchen - One of the best experts on this subject based on the ideXlab platform.
-
Constraint-Logic Object-Oriented Programming with Free Arrays
arXiv: Programming Languages, 2020Co-Authors: Jan C. Dageförde, Herbert KuchenAbstract:Constraint-logic Object-Oriented Programming provides a useful symbiosis between Object-Oriented Programming and constraint-logic search. The ability to use logic variables, constraints, non-deterministic search, and Object-Oriented Programming in an integrated way facilitates the combination of search-related program parts and other business logic in Object-Oriented applications. With this work we conceptualize array-typed logic variables ("free arrays"), thus completing the set of types that logic variables can assume in constraint-logic Object-Oriented Programming. Free arrays exhibit interesting properties, such as indeterminate lengths and non-deterministic accesses to array elements.
Kuchen Herbert - One of the best experts on this subject based on the ideXlab platform.
-
Constraint-Logic Object-Oriented Programming with Free Arrays
2020Co-Authors: Dageförde, Jan C., Kuchen HerbertAbstract:Constraint-logic Object-Oriented Programming provides a useful symbiosis between Object-Oriented Programming and constraint-logic search. The ability to use logic variables, constraints, non-deterministic search, and Object-Oriented Programming in an integrated way facilitates the combination of search-related program parts and other business logic in Object-Oriented applications. With this work we conceptualize array-typed logic variables ("free arrays"), thus completing the set of types that logic variables can assume in constraint-logic Object-Oriented Programming. Free arrays exhibit interesting properties, such as indeterminate lengths and non-deterministic accesses to array elements.Comment: Part of WFLP 2020 pre-proceeding