Results 11  20
of
449
Dumb money: Mutual fund flows and the cross section of stock returns,
 Journal of Financial Economics,
, 2008
"... We thank Nicholas Barberis and Judith Chevalier for helpful comments. We thank Breno Schmidt for research assistance. ABSTRACT We use mutual fund flows as a measure for individual investor sentiment for different stocks, and find that high sentiment predicts low future returns. Fund flows are dumb ..."
Abstract

Cited by 103 (4 self)
 Add to MetaCart
in a complex dynamic trading strategy of selling "high risk" value stocks and buying "low risk" growth stocks. Third, demand by individuals and supply from firms are highly related. When individuals indirectly buy more stock of a specific company (via mutual fund inflows), we also
A Coinduction Principle for Recursively Defined Domains
 THEORETICAL COMPUTER SCIENCE
, 1992
"... This paper establishes a new property of predomains recursively defined using the cartesian product, disjoint union, partial function space and convex powerdomain constructors. We prove that the partial order on such a recursive predomain D is the greatest fixed point of a certain monotone operator ..."
Abstract

Cited by 43 (3 self)
 Add to MetaCart
, whereas in the second case they are his applicative bisimulations. The coinduction principle also provides an apparently useful tool for reasoning about equality of elements of recursively defined datatypes in (strict or lazy) higher order functional programming languages.
Defining a nonconcrete recursive type in HOL which includes sets
, 2000
"... characterisation of Val pvt Axiom #f n f s f l f t :: #!para :: (#n :: para.(NUM.n) = f n .n) # (#s :: (FINITE.s) # (para.(SET.s) = f s .(image.(split.para).s))) # (#l :: para.(LIST.l) = f l .(map.(split.para).l)) # (#t :: para.(TREE.t) = f t .(map tree.(split.para).t)) J where: Definit ..."
Abstract
 Add to MetaCart
, this theorem states that: for all equivalence relations E on #, and subsets Q on #, if ABS and REP are mutually inverse bijections between some set # and Q/equiv, and h is a function of type # # # that does not disthinguish between di#erent elements in the same equivalence class, then there exists a unique
Reasoning About Logic Programs Using Definitions And Induction
, 2002
"... In this dissertation, we exhibit work revolving around the FO metalogic. After going over some of the background material on FO , we discuss work about induction, and give induction principles that are richer than mathematical induction, in that they yield shorter, simpler and more elegant pr ..."
Abstract
 Add to MetaCart
proofs. We then define and study notions of entailment and equivalence between two FO definitions. We make use of these notions by defining a framework, closely related to FO , for performing program transformation on definitions, and proving it correct. Finally, we discuss implementations
Efficient reasoning about executable specifications in Coq, in
 Tahar (eds), Theorem Proving in HigherOrder Logics (TPHOLs 2002
, 2002
"... Abstract. We describe a package to reason efficiently about executable specifications in Coq. The package provides a command for synthesizing a customized induction principle for a recursively defined function, and a tactic that combines the application of the customized induction principle with au ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
Abstract. We describe a package to reason efficiently about executable specifications in Coq. The package provides a command for synthesizing a customized induction principle for a recursively defined function, and a tactic that combines the application of the customized induction prin
A recursion combinator for nominal datatypes implemented in Isabelle/HOL
 IN PROC. OF THE 3RD INTERNATIONAL JOINT CONFERENCE ON AUTOMATED REASONING (IJCAR), VOLUME 4130 OF LNAI
, 2006
"... The nominal datatype package implements an infrastructure in Isabelle/HOL for defining languages involving binders and for reasoning conveniently about alphaequivalence classes. Pitts stated some general conditions under which functions over alphaequivalence classes can be defined by a form of str ..."
Abstract

Cited by 23 (9 self)
 Add to MetaCart
The nominal datatype package implements an infrastructure in Isabelle/HOL for defining languages involving binders and for reasoning conveniently about alphaequivalence classes. Pitts stated some general conditions under which functions over alphaequivalence classes can be defined by a form
Structural Induction and Coinduction in a Fibrational Setting
 Information and Computation
, 1997
"... . We present a categorical logic formulation of induction and coinduction principles for reasoning about inductively and coinductively defined types. Our main results provide sufficient criteria for the validity of such principles: in the presence of comprehension, the induction principle for in ..."
Abstract

Cited by 85 (16 self)
 Add to MetaCart
. We present a categorical logic formulation of induction and coinduction principles for reasoning about inductively and coinductively defined types. Our main results provide sufficient criteria for the validity of such principles: in the presence of comprehension, the induction principle
Reasoning about Sets using Redescription Mining
 KDD'05
, 2005
"... Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of association rule mining, from finding implications to equivalences; as a form of conceptual clustering, where the goal is to ide ..."
Abstract

Cited by 25 (13 self)
 Add to MetaCart
is to identify clusters that afford dual characterizations; and as a form of constructive induction, to build features based on given descriptors that mutually reinforce each other. In this paper, we present the use of redescription mining as an important tool to reason about a collection of sets, especially
The development of scientific reasoning skills
 Developmental Review
, 2000
"... The purpose of this article is to provide an introduction to the growing body of research on the development of scientific reasoning skills. The focus is on the reasoning and problemsolving strategies involved in experimentation and evidence evaluation. Research on strategy use in science has unde ..."
Abstract

Cited by 32 (1 self)
 Add to MetaCart
not believe that color is causally related to the quality of a tennis serve. Ruffman et al. argued that revising prior beliefs (e.g., about the causal power of color) is more difficult than forming new theories when prior beliefs do not exist or are not held with conviction. Literature on inductive inference
A Theory of Lists for HOL Based on HigherOrder Functions
 Supplementary Proceedings of the 7th International Workshop on Higher Order Logic Theorem Proving and its Applications, edited by Thomas F. Melham and Juanito Camilleri
, 1994
"... We describe the new HOL theory of lists. A notable feature is that it is based largely on higherorder functions: `fold left' and `fold right'. By using general theorems about these functions we have been able to provide tools which can quickly prove theorems about both system and userdef ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We describe the new HOL theory of lists. A notable feature is that it is based largely on higherorder functions: `fold left' and `fold right'. By using general theorems about these functions we have been able to provide tools which can quickly prove theorems about both system and userdefined
Results 11  20
of
449