Results 1  10
of
720
Computational Adequacy of the FIXLogic
, 1995
"... This paper presents computational adequacy results for the FIX logical system introduced by Crole and Pitts in LICS ’90. More precisely, we take two simple PCF style languages (whose dynamic semantics follow a callbyvalue and callbyname regime) give translations of the languages into suitable jud ..."
Abstract
 Add to MetaCart
This paper presents computational adequacy results for the FIX logical system introduced by Crole and Pitts in LICS ’90. More precisely, we take two simple PCF style languages (whose dynamic semantics follow a callbyvalue and callbyname regime) give translations of the languages into suitable
Computational Adequacy in an Elementary Topos
 Proceedings CSL ’98, Springer LNCS 1584
, 1999
"... . We place simple axioms on an elementary topos which suffice for it to provide a denotational model of callbyvalue PCF with sum and product types. The model is synthetic in the sense that types are interpreted by their settheoretic counterparts within the topos. The main result characterises whe ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
when the model is computationally adequate with respect to the operational semantics of the programming language. We prove that computational adequacy holds if and only if the topos is 1consistent (i.e. its internal logic validates only true \Sigma 0 1 sentences). 1 Introduction One axiomatic
Computational Adequacy via `Mixed' Inductive Definitions
 In Mathematical Foundations of Programming Semantics, Proc. 9th Int. Conf
, 1994
"... . For programming languages whose denotational semantics uses fixed points of domain constructors of mixed variance, proofs of correspondence between operational and denotational semantics (or between two different denotational semantics) often depend upon the existence of relations specified as the ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
as the fixed point of nonmonotonic operators. This paper describes a new approach to constructing such relations which avoids having to delve into the detailed construction of the recursively defined domains themselves. The method is introduced by example, by considering the proof of computational adequacy
Articulatory phonology, task dynamics and computational adequacy
 In ECSA 4th Tutorial and Workshop on Speech Production Modelling
, 1996
"... This paper discusses articulatory phonology and task dynamics as potentially computationally adequate models which, together, might characterise speech production. The idea is introduced that, particularly at the task dynamic level, the object oriented computational paradigm is appropriate this is ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
is a novel approach in speech production modelling. The paper concludes that articulatory phonology and task dynamics are a step toward computational adequacy, but that that goal is not quite reached. ___________________________________________________________________________ THE BASIC THEORY
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
 In Proc. 17th IEEE Symposium on Logic in Computer Science
, 2003
"... This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domaintheoretic and realizability models as concrete instances. Our approach is to view such models as full subcategories of categorical models of intuitionistic set theory. It is shown ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
of the ambient model of intuitionistic set theory, we analyse the relationship between operational and denotational semantics. We first prove an “internal ” computational adequacy theorem: the model always believes that the operational and denotational notions of termination agree. This allows us to identify
Computational Adequacy via `Mixed ' Inductive De nitions
"... Abstract. For programming languages whose denotational semantics uses xed points of domain constructors of mixed variance, proofs of correspondence between operational and denotational semantics (or between two di erent denotational semantics) often depend upon the existence of relations speci ed as ..."
Abstract
 Add to MetaCart
as the xed point of nonmonotonic operators. This paper describes a new approach to constructing such relations which avoids having to delve into the detailed construction of the recursively de ned domains themselves. The method is introduced by example, by considering the proof of computational adequacy
The Generative Lexicon
 Computational Linguistics
, 1991
"... this paper, I will discuss four major topics relating to current research in lexical semantics: methodology, descriptive coverage, adequacy of the representation, and the computational usefulness of representations. In addressing these issues, I will discuss what I think are some of the central prob ..."
Abstract

Cited by 1341 (45 self)
 Add to MetaCart
this paper, I will discuss four major topics relating to current research in lexical semantics: methodology, descriptive coverage, adequacy of the representation, and the computational usefulness of representations. In addressing these issues, I will discuss what I think are some of the central
MIXED MNL MODELS FOR DISCRETE RESPONSE
 JOURNAL OF APPLIED ECONOMETRICS J. APPL. ECON. 15: 447470 (2000)
, 2000
"... This paper considers mixed, or random coefficients, multinomial logit (MMNL) models for discrete response, and establishes the following results. Under mild regularity conditions, any discrete choice model derived from random utility maximization has choice probabilities that can be approximated as ..."
Abstract

Cited by 487 (15 self)
 Add to MetaCart
as closely as one pleases by a MMNL model. Practical estimation of a parametric mixing family can be carried out by Maximum Simulated Likelihood Estimation or Method of Simulated Moments, and easily computed instruments are provided that make the latter procedure fairly efficient. The adequacy of a mixing
Features of similarity.
 Psychological Review
, 1977
"... Similarity plays a fundamental role in theories of knowledge and behavior. It serves as an organizing principle by which individuals classify objects, form concepts, and make generalizations. Indeed, the concept of similarity is ubiquitous in psychological theory. It underlies the accounts of stimu ..."
Abstract

Cited by 1455 (2 self)
 Add to MetaCart
in terms of a few quantitative dimensions. The assessment of similarity between such stimuli, therefore, may be better described as a comparison of features rather than as the computation of metric distance between points. A metric distance function, d, is a scale that assigns to every pair of points a
Elementary Proofs of Adequacy
, 1997
"... We give a technique for proving computational adequacy, applied to models of Plotkin's FPC. The proof is elementary, in that it avoids the use of certain abstract notions, namely logical relations. The technique appears to be quite general. We present an arbitrary term using fixedpoints whose ..."
Abstract
 Add to MetaCart
We give a technique for proving computational adequacy, applied to models of Plotkin's FPC. The proof is elementary, in that it avoids the use of certain abstract notions, namely logical relations. The technique appears to be quite general. We present an arbitrary term using fixedpoints whose
Results 1  10
of
720