Results 1  10
of
424
Numbering matters: Firstorder canonical forms for secondorder recursive types
 In Proceedings of the 2004 ACM SIGPLAN International Conference on Functional Programming (ICFP’04
, 2004
"... We study a type system equipped with universal types and equirecursive types, which we refer to as Fµ. We show that type equality may be decided in time O(n log n), an improvement over the previous known bound of O(n 2). In fact, we show that two more general problems, namely entailment of type equa ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
equations and type unification, may be decided in time O(n log n), a new result. To achieve this bound, we associate, with every Fµ type, a firstorder canonical form, which may be computed in time O(n log n). By exploiting this notion, we reduce all three problems to equality and unification of firstorder
Whom You Know Matters: Venture Capital Networks and Investment Performance,
 Journal of Finance
, 2007
"... Abstract Many financial markets are characterized by strong relationships and networks, rather than arm'slength, spotmarket transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company inv ..."
Abstract

Cited by 138 (8 self)
 Add to MetaCart
in the first round from the unconditional expectation of 66.8% to 72.4%, in the second round from 77.7% to 83.4%, and in the third round from 79.2% to 86.4%. As in the fundlevel models, the network measures capturing the number and quality of relationships (degree and eigenvector) and access to other VCs
Recursive Function Definition
"... Abstract. Using the notions of unique fixed point, converging equivalence relation, and contracting function, we generalize the technique of wellfounded recursion. We are able to define functions in the Isabelle theorem prover that recursively call themselves an infinite number of times. In particu ..."
Abstract
 Add to MetaCart
be defined using wellfounded recursion: map:: (ff! fi) ! ff list! fi list map f [] = [] map f (x#xs) = (f x) # (map f xs) The first rule states that map applied to the empty list, denoted by [], is equal to the empty list. The second rule states that map applied to a list constructed out of the head
Materials for an exploratory theory of the network society.
 The British Journal of Sociology
, 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, crosscultural investigation. It permeates most societies in the world, in v ..."
Abstract

Cited by 122 (0 self)
 Add to MetaCart
reliance on networks as the key feature of social morphology. While networks are old forms of social organization, they are now empowered by new information/communication technologies, so that they become able to cope at the same time with exible decentralization, and with focused decision
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
to the nonproportional allocation of flows to mutual funds, is 25 19.4 = 5.6%. FLOW is an indicator of what types of stocks are owned by funds experiencing big inflows. It is a number that can be positive, as in this example, or negative (if the stock is owned by funds experiencing outflows or lower
TIME AND MATTER 2010 CONFERENCE A short introduction to Asymptotic Safety
"... Abstract: I discuss the notion of asymptotic safety and possible applications to quantum field theories of gravity and matter. What is asymptotic safety? We want to discuss the high energy behavior of a quantum field theory (QFT). Assume that a “theory space ” has been defined by giving a set of fi ..."
Abstract
 Add to MetaCart
Abstract: I discuss the notion of asymptotic safety and possible applications to quantum field theories of gravity and matter. What is asymptotic safety? We want to discuss the high energy behavior of a quantum field theory (QFT). Assume that a “theory space ” has been defined by giving a set
Recursion Theory and Undecidability Lecture Notes for CSCI 303 by David Kempe
, 2008
"... In the second half of the class, we will explore limits on computation. These are questions of the form “What types of things can be computed at all? ” “What types of things can be computed efficiently? ” “How fast can problem XYZ be solved? ” We already saw some positive examples in class: problems ..."
Abstract
 Add to MetaCart
In the second half of the class, we will explore limits on computation. These are questions of the form “What types of things can be computed at all? ” “What types of things can be computed efficiently? ” “How fast can problem XYZ be solved? ” We already saw some positive examples in class
See What You Want to See: Motivational Influences on Visual Perception,”
 Journal of Personality and Social Psychology,
, 2006
"... People's motivational statestheir wishes and preferencesinfluence their processing of visual stimuli. In 5 studies, participants shown an ambiguous figure (e.g., one that could be seen either as the letter B or the number 13) tended to report seeing the interpretation that assigned them to o ..."
Abstract

Cited by 79 (1 self)
 Add to MetaCart
sensation of that one beverage. On the table in front of participants sat the two beverages. The first was the desirable one: freshly squeezed orange juice. The second was the less desirable alternative: a gelatinous, chunky, green, foulsmelling, somewhat viscous concoction labeled as an "
Remembering over the shortterm: The case against the standard model.
 Annual Review of Psychology,
, 2002
"... s Abstract Psychologists often assume that shortterm storage is synonymous with activation, a mnemonic property that keeps information in an immediately accessible form. Permanent knowledge is activated, as a result of online cognitive processing, and an activity trace is established "in&quo ..."
Abstract

Cited by 74 (0 self)
 Add to MetaCart
, or interitem similarity. Does rehearsal occur only during stimulus input, or does it also occur during response output? Does it matter whether one rehearses based primarily on sound, or is it necessary to access meaning in order to maintain the activation of permanent knowledge? The idea of the standard "
and
, 2015
"... Effective support for custom proof automation is essential for largescale interactive proof development. However, existing languages for automation via tactics either (a) provide no way to specify the behavior of tactics within the base logic of the accompanying theorem prover, or (b) rely on adva ..."
Abstract
 Add to MetaCart
on advanced typetheoretic machinery that is not easily integrated into established theorem provers. We present Mtac, a lightweight but powerful extension to Coq that supports dependently typed tactic programming. Mtac tactics have access to all the features of ordinary Coq programming, as well as a new set
Results 1  10
of
424