Results 1  10
of
805
A theory of primitive objects: secondorder systems
 Proc. ESOP’94  European Symposium on Programming
"... We describe a secondorder calculus of objects. The calculus supports object subsumption, method override, and the type Self. It is constructed as an extension of System F with subtyping, recursion, and firstorder object types. 1. ..."
Abstract

Cited by 57 (7 self)
 Add to MetaCart
We describe a secondorder calculus of objects. The calculus supports object subsumption, method override, and the type Self. It is constructed as an extension of System F with subtyping, recursion, and firstorder object types. 1.
On Extensions of. . . : SecondOrder LambdaCalculus with Subtyping
, 1994
"... F was an extension of a secondorder calculus F which has parametric polymorphism with subtyping and bounded quantification, introduced by Ghelli to apply secondorder calculi to the framework of objectoriented languages. However, it is impossible to know the amount of information of a typeche ..."
Abstract
 Add to MetaCart
F was an extension of a secondorder calculus F which has parametric polymorphism with subtyping and bounded quantification, introduced by Ghelli to apply secondorder calculi to the framework of objectoriented languages. However, it is impossible to know the amount of information of a type
Kripke Models and the (in)equational Logic of the SecondOrder LambdaCalculus
, 1995
"... . We define a new class of Kripke structures for the secondorder calculus, and investigate the soundness and completeness of some proof systems for proving inequalities (rewrite rules) as well as equations. The Kripke structures under consideration are equipped with preorders that correspond to an ..."
Abstract
 Add to MetaCart
. We define a new class of Kripke structures for the secondorder calculus, and investigate the soundness and completeness of some proof systems for proving inequalities (rewrite rules) as well as equations. The Kripke structures under consideration are equipped with preorders that correspond
of secondorder filters without calculus
, 2012
"... The maximum gain (with respect to frequency) of secondorder filters such as lowpass, highpass, bandpass, lowpass notch and highpass notch filters is derived without using calculus. Our method uses the fact that the square of the magnitude response (gain) for these filters can be written as a p ..."
Abstract
 Add to MetaCart
The maximum gain (with respect to frequency) of secondorder filters such as lowpass, highpass, bandpass, lowpass notch and highpass notch filters is derived without using calculus. Our method uses the fact that the square of the magnitude response (gain) for these filters can be written as a
An Elementary Fragment of SecondOrder Lambda Calculus
 ACM Transactions on Computational Logic
, 2005
"... A fragment of secondorder lambda calculus (System F) is defined that characterizes the elementary recursive functions. Type quantification is restricted to be noninterleaved and stratified, i.e., the types are assigned levels, and a quantified variable can only be instantiated by a type of smaller ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
A fragment of secondorder lambda calculus (System F) is defined that characterizes the elementary recursive functions. Type quantification is restricted to be noninterleaved and stratified, i.e., the types are assigned levels, and a quantified variable can only be instantiated by a type
RPO, Secondorder Contexts, and λcalculus?
"... Abstract. We apply LeiferMilner RPO approach to the λcalculus, endowed with lazy and call by value reduction strategies. We show that, contrary to process calculi, one can deal directly with the λcalculus syntax and apply LeiferMilner technique to a category of contexts, provided that we work ..."
Abstract
 Add to MetaCart
. To overcome this problem, we introduce the general notion of secondorder context category. We show that, by carrying out the RPO construction in this setting, the lazy (call by value) observational equivalence can be captured as a weak bisimilarity equivalence on a finitely branching transition system
RPO, Secondorder Contexts, and λcalculus
"... We apply LeiferMilner RPO approach to the λcalculus, endowed with lazy and call by value reduction strategies. We show that, contrary to process calculi, one can deal directly with the λcalculus syntax and apply LeiferMilner technique to a category of contexts, provided that we work in the frame ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We apply LeiferMilner RPO approach to the λcalculus, endowed with lazy and call by value reduction strategies. We show that, contrary to process calculi, one can deal directly with the λcalculus syntax and apply LeiferMilner technique to a category of contexts, provided that we work
Counterpart Semantics for a SecondOrder µCalculus
 FUNDAMENTA INFORMATICAE
"... Quantified µcalculi combine the fixpoint and modal operators of temporal logics with (existential and universal) quantifiers, and they allow for reasoning about the possible behaviour of individual components within a software system. In this paper we introduce a novel approach to the semantics of ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Quantified µcalculi combine the fixpoint and modal operators of temporal logics with (existential and universal) quantifiers, and they allow for reasoning about the possible behaviour of individual components within a software system. In this paper we introduce a novel approach to the semantics of such calculi: we consider a sort of labelled transition systems called counterpart models as semantic domain, where states are algebras and transitions are defined by counterpart relations (a family of partial homomorphisms) between states. Then, formulae are interpreted over sets of state assignments (families of partial substitutions, associating formula variables to state components). Our proposal allows us to model and reason about the creation and deletion of components, as well as the merging of components. Moreover, it avoids the limitations of existing approaches, usually enforcing restrictions of the transition relation: the resulting semantics is a streamlined and intuitively appealing one, yet it is general enough to cover most of the alternative proposals we are aware of. The paper is rounded up with some considerations about expressiveness and decidability aspects.
Parigot's Second Order λμCalculus and Inductive Types
, 2001
"... . A new proof of strong normalization of Parigot's (second order) calculus is given by a reductionpreserving embedding into system F (second order polymorphic calculus). The main idea is to use the least stable supertype for any type. These nonstrictly positive inductive types and their ass ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. A new proof of strong normalization of Parigot's (second order) calculus is given by a reductionpreserving embedding into system F (second order polymorphic calculus). The main idea is to use the least stable supertype for any type. These nonstrictly positive inductive types
The polyadic πcalculus: a tutorial
 LOGIC AND ALGEBRA OF SPECIFICATION
, 1991
"... The πcalculus is a model of concurrent computation based upon the notion of naming. It is first presented in its simplest and original form, with the help of several illustrative applications. Then it is generalized from monadic to polyadic form. Semantics is done in terms of both a reduction syste ..."
Abstract

Cited by 187 (1 self)
 Add to MetaCart
and strengthens the original result of this kind given by Bent Thomsen for secondorder processes.
Results 1  10
of
805