Results 1  10
of
14
A Compositional Logic for Polymorphic HigherOrder Functions
 PPDP'04
, 2004
"... This paper introduces a compositional program logic for higherorder polymorphic functions and standard data types. The logic enables us to reason about observable properties of polymorphic programs starting from those of their constituents. Just as types attached to programs offer information on the ..."
Abstract

Cited by 28 (11 self)
 Add to MetaCart
This paper introduces a compositional program logic for higherorder polymorphic functions and standard data types. The logic enables us to reason about observable properties of polymorphic programs starting from those of their constituents. Just as types attached to programs offer information on their composability so as to guarantee basic safety of composite programs, formulae of the proposed logic attached to programs offer information on their composability so as to guarantee finegrained behavioural properties of polymorphic programs. The central feature of the logic is a systematic usage of names and operations on them, whose origin is in the logics for typed πcalculi. The paper introduces the program logic and its proof rules and illustrates their usage by nontrivial reasoning examples, taking a prototypical callbyvalue functional language with impredicative polymorphism and recursive types as a target language.
Logical equivalence for subtyping object and recursive types
"... Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalised through an assignment system. It is shown that equality in the full first order ςcalculus is modelled by this notion, which i ..."
Abstract

Cited by 12 (10 self)
 Add to MetaCart
Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalised through an assignment system. It is shown that equality in the full first order ςcalculus is modelled by this notion, which in turn is included in a Morrisstyle contextual equivalence.
Subtyping in Logical Form
, 2003
"... By using intersection types and filter models we formulate a theory of types for a λcalculus with record subtyping via a finitary programming logic. Types are interpreted as spaces of filters over a subset of the language of properties (the intersection types) which describes the underlying type fr ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
By using intersection types and filter models we formulate a theory of types for a λcalculus with record subtyping via a finitary programming logic. Types are interpreted as spaces of filters over a subset of the language of properties (the intersection types) which describes the underlying type free realizability structure. We show that such an interpretation is a PER semantics, proving that the quotient space arising from “logical” PERs taken with the intrinsic ordering is isomorphic to the filter semantics of types.
Restricted intersection type assignment systems and object properties
, 2002
"... In this note we consider a restricted version of the intersection types for a #calculus with records as presented in [5, 6] w.r.t. principal typing property and expressivity. We sketch how the classical approach to principal typing for intersection type assignment system can be adapted to cope with ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this note we consider a restricted version of the intersection types for a #calculus with records as presented in [5, 6] w.r.t. principal typing property and expressivity. We sketch how the classical approach to principal typing for intersection type assignment system can be adapted to cope with record types. We then exemplify typings in our system of selfapplication and recursive record interpretations of objects. 1
On Normalization by Evaluation for Object Calculi
"... We present a procedure for computing normal forms of terms in Abadi and Cardelli’s functional object calculus. Even when equipped with simple types, terms of this calculus are not terminating in general, and we draw on recent ideas about the normalization by evaluation paradigm for the untyped lambd ..."
Abstract
 Add to MetaCart
We present a procedure for computing normal forms of terms in Abadi and Cardelli’s functional object calculus. Even when equipped with simple types, terms of this calculus are not terminating in general, and we draw on recent ideas about the normalization by evaluation paradigm for the untyped lambda calculus. Technically, we work in the framework of Shinwell and Pitts ’ FMdomain theory, which leads to a normalization procedure for the object calculus that is directly implementable in a language like Fresh O’Caml.
Project funded by the European Community under the ‘Information Society Technologies’
"... this paper we show how they can be recast into algorithmic inference rules by applying a combination of standard techniques, among which constraint handling plays a central role. We then analyse the generated constraint sets and show that they share a common structure which can be simplified with a ..."
Abstract
 Add to MetaCart
this paper we show how they can be recast into algorithmic inference rules by applying a combination of standard techniques, among which constraint handling plays a central role. We then analyse the generated constraint sets and show that they share a common structure which can be simplified with a specialised algorithm we present. As the constraint simplification procedure is mainly based on unification, we implemented the whole inference algorithm in a Prolog program which we will comment upon
Semantic Types for Classbased Objects
, 2012
"... We investigate semanticsbased type assignment for classbased objectoriented programming. Our motivation is developing a theoretical basis for practical, expressive, typebased analysis of the functional behaviour of objectoriented programs. We focus our research using Featherweight Java, studyi ..."
Abstract
 Add to MetaCart
(Show Context)
We investigate semanticsbased type assignment for classbased objectoriented programming. Our motivation is developing a theoretical basis for practical, expressive, typebased analysis of the functional behaviour of objectoriented programs. We focus our research using Featherweight Java, studying two notions of type assignment: one using intersection types, the other a ‘logical ’ restriction of recursive types. We extend to the objectoriented setting some existing results for intersection type systems. In doing so, we contribute to the study of denotational semantics for objectoriented languages. We define a model for Featherweight Java based on approximation, which we relate to our intersection type system via an Approximation Result, proved using a notion of reduction on typing derivations that we show to be strongly normalising. We consider restrictions of our system for which type assignment is decidable, observing that the implicit recursion present in the class mechanism is a limiting factor in making practical use of the expressive power of intersection types. To overcome this, we consider type assignment based on recursive types. Such types traditionally suffer from the inability to characterise convergence, a key element of our approach. To obtain a se
(Theory of Computing Systems, 42(3):306348, 2008)
"... equivalence for subtyping object and recursive types ..."
(Show Context)
Logical Semantics for the First Order ζCalculus
 LNCS
, 2003
"... We investigate logical semantics of the first order #calculus. An assignment system of predicates to first order typed terms of the OB1 calculus is introduced. We define retraction models for that calculus and an interpretation of terms, types and predicates into such models. The assignment system ..."
Abstract
 Add to MetaCart
We investigate logical semantics of the first order #calculus. An assignment system of predicates to first order typed terms of the OB1 calculus is introduced. We define retraction models for that calculus and an interpretation of terms, types and predicates into such models. The assignment system is then proved to be sound and complete w.r.t. retraction models. 1
Digital Object Identifier 10.4230/DagRep.4.6.29 Edited in cooperation with Dror Fried 1 Executive Summary
"... This report documents the program and the outcomes of Dagstuhl Seminar 14232 “Design and Synthesis from Components ” which took place from June 1st to June 6th, 2014. The seminar aimed at bringing together researchers from the componentoriented design community, researchers working on interface th ..."
Abstract
 Add to MetaCart
This report documents the program and the outcomes of Dagstuhl Seminar 14232 “Design and Synthesis from Components ” which took place from June 1st to June 6th, 2014. The seminar aimed at bringing together researchers from the componentoriented design community, researchers working on interface theories, and researchers working in synthesis, in order to explore the use of component and interface design in program synthesis. The seminar program consisted of 6 tutorial talks (1 hour) and 16 contributed talks (30 mins) as well as joint discussion sessions. This report documents the abstracts of the talks as well as summaries of discussion sessions.