Results 1  10
of
3,750,758
Axioms for Recursion in CallbyValue
 HIGHERORDER AND SYMBOLIC COMPUT
, 2001
"... We propose an axiomatization of fixpoint operators in typed callbyvalue programming languages, and give its justifications in two ways. First, it is shown to be sound and complete for the notion of uniform Tfixpoint operators of Simpson and Plotkin. Second, the axioms precisely account for Filins ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
We propose an axiomatization of fixpoint operators in typed callbyvalue programming languages, and give its justifications in two ways. First, it is shown to be sound and complete for the notion of uniform Tfixpoint operators of Simpson and Plotkin. Second, the axioms precisely account
CallbyValue Games
, 1997
"... . A general construction of models of callbyvalue from models of callbyname computation is described. The construction makes essential use of the properties of sum types in common denotational models of callbyname. When applied to categories of games, it yields fully abstract models of the cal ..."
Abstract

Cited by 77 (7 self)
 Add to MetaCart
. A general construction of models of callbyvalue from models of callbyname computation is described. The construction makes essential use of the properties of sum types in common denotational models of callbyname. When applied to categories of games, it yields fully abstract models
LIGHT LOGICS AND THE CALLBYVALUE LAMBDA CALCULUS
, 809
"... Abstract. The socalled light logics [13, 1, 2] have been introduced as logical systems enjoying quite remarkable normalization properties. Designing a type assignment system for pure lambda calculus from these logics, however, is problematic, as discussed in [6]. In this paper we show that shifting ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
that shifting from usual callbyname to callbyvalue lambda calculus allows regaining strong connections with the underlying logic. This will be done in the context of Elementary Affine Logic (EAL), designing a type system in natural deduction style assigning EAL formulae to lambda terms. 1.
Axioms for Recursion in CallbyValue (Extended Abstract)
, 2001
"... ) Masahito Hasegawa and Yoshihiko Kakutani Research Institute for Mathematical Sciences, Kyoto University {hassei,kakutani}@kurims.kyotou.ac.jp Abstract. We propose an axiomatization of fixpoint operators in typed callbyvalue programming languages, and give its justifications in two ways. First ..."
Abstract
 Add to MetaCart
) Masahito Hasegawa and Yoshihiko Kakutani Research Institute for Mathematical Sciences, Kyoto University {hassei,kakutani}@kurims.kyotou.ac.jp Abstract. We propose an axiomatization of fixpoint operators in typed callbyvalue programming languages, and give its justifications in two ways
Duality between CallbyName Recursion and CallbyValue Iteration
 IN PROC. COMPUTER SCIENCE LOGIC, SPRINGER LECTURE NOTES IN COMPUT. SCI
, 2001
"... We investigate the duality between callbyname recursion and callbyvalue iteration on the λµcalculi. The duality between callbyname and callbyvalue was first studied by Filinski, and Selinger has studied the categorytheoretic duality on the models of the callbyname λµcalculus and the cal ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
We investigate the duality between callbyname recursion and callbyvalue iteration on the λµcalculi. The duality between callbyname and callbyvalue was first studied by Filinski, and Selinger has studied the categorytheoretic duality on the models of the callbyname λµ
LIGHT LOGICS AND THE CALLBYVALUE LAMBDA CALCULUS
, 2007
"... Vol. 4 (4:5) 2008, pp. 1–28 www.lmcsonline.org ..."
Books in graphs
, 2008
"... A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α) ..."
Abstract

Cited by 2380 (22 self)
 Add to MetaCart
A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α
Ontologies: Principles, methods and applications
 KNOWLEDGE ENGINEERING REVIEW
, 1996
"... This paper is intended to serve as a comprehensive introduction to the emerging field concerned with the design and use of ontologies. We observe that disparate backgrounds, languages, tools, and techniques are a major barrier to effective communication among people, organisations, and/or software s ..."
Abstract

Cited by 570 (3 self)
 Add to MetaCart
then consider the bene ts of and describe, a more formal approach. We revisit the scoping phase, and discuss the role of formal languages and techniques in the specification, implementation and evaluation of ontologies. Finally, we review the state of the art and practice in this emerging field,
Bayes Factors
, 1995
"... In a 1935 paper, and in his book Theory of Probability, Jeffreys developed a methodology for quantifying the evidence in favor of a scientific theory. The centerpiece was a number, now called the Bayes factor, which is the posterior odds of the null hypothesis when the prior probability on the null ..."
Abstract

Cited by 1766 (74 self)
 Add to MetaCart
In a 1935 paper, and in his book Theory of Probability, Jeffreys developed a methodology for quantifying the evidence in favor of a scientific theory. The centerpiece was a number, now called the Bayes factor, which is the posterior odds of the null hypothesis when the prior probability on the null
Results 1  10
of
3,750,758