Results 1  10
of
1,462
Lambda Calculus with Explicit Recursion
 Information and Computation
, 1996
"... This paper is concerned with the study of calculus with explicit recursion, namely of cyclic graphs. The starting point is to treat a graph as a system of recursion equations involving terms, and to manipulate such systems in an unrestricted manner, using equational logic, just as is possible fo ..."
Abstract

Cited by 43 (5 self)
 Add to MetaCart
This paper is concerned with the study of calculus with explicit recursion, namely of cyclic graphs. The starting point is to treat a graph as a system of recursion equations involving terms, and to manipulate such systems in an unrestricted manner, using equational logic, just as is possible
Explicitly Recursive Grammar Combinators  The Implementation of some Grammar Algorithms
, 2010
"... In a companion paper, we have presented an alternative representation of grammars in Haskell, explicitizing the grammar’s recursion, decoupling the grammar from its semantic actions and making semantic actions independent of matching order. In this technical report, we present the implementation of ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In a companion paper, we have presented an alternative representation of grammars in Haskell, explicitizing the grammar’s recursion, decoupling the grammar from its semantic actions and making semantic actions independent of matching order. In this technical report, we present the implementation
A New RecursionTheoretic Characterization Of The Polytime Functions
 COMPUTATIONAL COMPLEXITY
, 1992
"... We give a recursiontheoretic characterization of FP which describes polynomial time computation independently of any externally imposed resource bounds. In particular, this syntactic characterization avoids the explicit size bounds on recursion (and the initial function 2 xy ) of Cobham. ..."
Abstract

Cited by 230 (7 self)
 Add to MetaCart
We give a recursiontheoretic characterization of FP which describes polynomial time computation independently of any externally imposed resource bounds. In particular, this syntactic characterization avoids the explicit size bounds on recursion (and the initial function 2 xy ) of Cobham.
Overconfidence and speculative bubbles
 Journal of Political Economy
, 2003
"... Motivated by the behavior of asset prices, trading volume and price volatility during historical episodes of asset price bubbles, we present a continuous time equilibrium model where overconfidence generates disagreements among agents regarding asset fundamentals. With shortsale constraints, an ass ..."
Abstract

Cited by 329 (22 self)
 Add to MetaCart
, an asset owner has an option to sell the asset to other overconfident agents when they have more optimistic beliefs. As in Harrison and Kreps (1978), this resale option has a recursive structure, that is, a buyer of the asset gets the option to resell it. Agents pay prices that exceed their own valuation
Alias Types for Recursive Data Structures
, 2000
"... Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a pseudolinear type system that allows a degree of aliasing and memory reuse as well as the ability to define complex recu ..."
Abstract

Cited by 147 (13 self)
 Add to MetaCart
Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a pseudolinear type system that allows a degree of aliasing and memory reuse as well as the ability to define complex
Modeling Sharing and Recursion for Weak Reduction Strategies using Explicit Substitution
, 1996
"... We present the ...calculus, a formal synthesis of the concepts of sharing and explicit substitution for weak reduction. We show how ... can be used as a foundation of implementations of functional programming languages by modeling the essential ingredients of such implementations, namely weak reduc ..."
Abstract

Cited by 28 (6 self)
 Add to MetaCart
graphreduction vs. environmentbased evaluation. Second, we show how to add constructors and explicit recursion to give a precise account of recursive functions and data structures even with respect to space complexity. Third, we formalize the notion of space leaks in ... and use this to define a space leak free
Improved Localization of Cortical Activity by Combining EEG and MEG with MRI Cortical Surface Reconstruction: A Linear Approach
 J. Cogn. Neurosci
, 1993
"... We describe a comprehensive linear approach to the prob lem of imaging brain activity with high temporal as well as spatial resolution based on combining EEG and MEG data with anatomical constraints derived from MRI images. The "inverse problem" of estimating the distribution of dipole st ..."
Abstract

Cited by 263 (19 self)
 Add to MetaCart
strengths over the conical surface is highly nnderdetermined, even given closely spaced EEG and MEG recordings. ',x.'c h:,vc obtained much better solutions to this problem by explicitly incorporating both local cortical orientation as well as spatial covariance of sources and sensors into our
An Indexed Model of Recursive Types for Foundational ProofCarrying Code
 ACM Transactions on Programming Languages and Systems
, 2000
"... The proofs of "traditional" proof carrying code (PCC) are typespecialized in the sense that they require axioms about a specific type system. In contrast, the proofs of foundational PCC explicitly define all required types and explicitly prove all the required properties of those types as ..."
Abstract

Cited by 154 (13 self)
 Add to MetaCart
The proofs of "traditional" proof carrying code (PCC) are typespecialized in the sense that they require axioms about a specific type system. In contrast, the proofs of foundational PCC explicitly define all required types and explicitly prove all the required properties of those types
unknown title
"... Efficient, stable and accurate explicit recursive migration operators: A comparison ..."
Abstract
 Add to MetaCart
Efficient, stable and accurate explicit recursive migration operators: A comparison
Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity
 In Proceedings of European Conference on Logics in Artificial Intelligence (JELIA
, 2004
"... Abstract. The addition of aggregates has been one of the most relevant enhancements to the language of answer set programming (ASP). They strengthen the modeling power of ASP, in terms of concise problem representations. While many important problems can be encoded using nonrecursive aggregates, som ..."
Abstract

Cited by 115 (15 self)
 Add to MetaCart
, some relevant examples lend themselves for the use of recursive aggregates. Previous semantic definitions typically agree in the nonrecursive case, but the picture is less clear for recursion. Some proposals explicitly avoid recursive aggregates, most others differ, and many of them do not satisfy
Results 1  10
of
1,462