Results 1  10
of
279
Calculus of Bargaining Solution on Boolean Tables
, 2003
"... This article reports not only a theoretical solution of bargaining problem as used by game theoreticians but also an adequate calculus. By adequate calculus we understand an algorithm that can lead us to the result within reasonable timetable using either the computing power of nowadays computers or ..."
Abstract
 Add to MetaCart
This article reports not only a theoretical solution of bargaining problem as used by game theoreticians but also an adequate calculus. By adequate calculus we understand an algorithm that can lead us to the result within reasonable timetable using either the computing power of nowadays computers
ECC, an Extended Calculus of Constructions
, 1989
"... We present a higherorder calculus ECC which can be seen as an extension of the calculus of constructions [CH88] by adding strong sum types and a fully cumulative type hierarchy. ECC turns out to be rather expressive so that mathematical theories can be abstractly described and abstract mathematics ..."
Abstract

Cited by 90 (4 self)
 Add to MetaCart
may be adequately formalized. It is shown that ECC is strongly normalizing and has other nice prooftheoretic properties. An !\GammaSet (realizability) model is described to show how the essential properties of the calculus can be captured settheoretically.
The πCalculus in Direct Style
, 1997
"... We introduce a calculus which is a direct extension of both the and the π calculi. We give a simple type system for it, that encompasses both Curry's type inference for the calculus, and Milner's sorting for the πcalculus as particular cases of typing. We observe that the various contin ..."
Abstract

Cited by 69 (2 self)
 Add to MetaCart
. Finally we provide an adequate cps transform from our calculus to the πcalculus. This shows that the latter may be regarded as an "assembly language", while our calculus seems to provide a better programming notation for higherorder concurrency.
An Adequate LeftAssociated Binary Numeral System in the lambdaCalculus
, 1996
"... This paper introduces a sequence of expressions modelling the binary expansion of integers. We derive expressions computing the test for zero, the successor function, and the predecessor function, thereby showing the sequence to be an adequate numeral system. These functions can be computed eff ..."
Abstract
 Add to MetaCart
This paper introduces a sequence of expressions modelling the binary expansion of integers. We derive expressions computing the test for zero, the successor function, and the predecessor function, thereby showing the sequence to be an adequate numeral system. These functions can be computed
An adequate logic for heterogeneous systems
, 2013
"... We coalgebraically define a unified semantics for systems with an emphasis on the notion of time. Such a semantics intends to formalize system that underly system engineering (i.e. the discipline focusing on the integration mastery of large industrial systems). Moreover, we give a formal meaning to ..."
Abstract
 Add to MetaCart
to another important aspect of systems engineering: system requirements, constraining the expected properties of a system. To express such requirements, we define a logic that extends µcalculus to our coalgebraic definition of systems. We establish an important property of this logic: adequacy.
A Resolution Calculus for Presuppositions
 Proceedings of the 12th ECAI
, 1996
"... . The semantics of everyday language and the semantics of its naive translation into classical firstorder language considerably differ. An important discrepancy that is addressed in this paper is about the implicit assumption what exists. For instance, in the case of universal quantification natura ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
hypothetical objects in everyday language. These problems have been discussed in philosophical logic and some adequate manyvalued logics were developed to model these phenomena much better than classical firstorder logic can do. An adequate calculus, however, has not yet been given. Recent years have seen a
The LambdaCalculus with Multiplicities
, 1993
"... We introduce a refinement of the λcalculus, where the argument of a function is a bag of resources, that is a multiset of terms, whose multiplicities indicate how many copies of them are available. We show that this "λcalculus with multiplicities" has a natural functionality theory, simi ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
, similar to Coppo and Dezani's intersection type discipline. In our functionality theory the conjunction is managed in a "multiplicative" manner, according to Girard's terminology. We show that this provides an adequate interpretation of the calculus, by establishing that a term
Discrete symbol calculus
, 2008
"... This paper deals with efficient numerical representation and manipulation of differential and integral operators as symbols in phasespace, i.e., functions of space x and frequency ξ. The symbol smoothness conditions obeyed by many operators in connection to smooth linear partial differential equati ..."
Abstract

Cited by 15 (9 self)
 Add to MetaCart
equations allow to write fastconverging, nonasymptotic expansions in adequate systems of rational Chebyshev functions or hierarchical splines. The classical results of closedness of such symbol classes under multiplication, inversion and taking the square root translate into practical iterative algorithms
KripkeStyle Models for Typed Lambda Calculus
 Annals of Pure and Applied Logic
, 1996
"... The semantics of typed lambda calculus is usually described using Henkin models, consisting of functions over some collection of sets, or concrete cartesian closed categories, which are essentially equivalent. We describe a more general class of Kripkestyle models. In categorical terms, our Kripke ..."
Abstract

Cited by 51 (3 self)
 Add to MetaCart
The semantics of typed lambda calculus is usually described using Henkin models, consisting of functions over some collection of sets, or concrete cartesian closed categories, which are essentially equivalent. We describe a more general class of Kripkestyle models. In categorical terms, our Kripke
Results 1  10
of
279