Results 1  10
of
14
Probabilistic Operational Semantics for the Lambda Calculus
"... Probabilistic operational semantics for a nondeterministic extension of pure lambda calculus is studied. In this semantics, a term evaluates to a (finite or infinite) distribution of values. Smallstep and bigstep semantics are both inductively and coinductively defined. Moreover, smallstep and bi ..."
Abstract
 Add to MetaCart
Probabilistic operational semantics for a nondeterministic extension of pure lambda calculus is studied. In this semantics, a term evaluates to a (finite or infinite) distribution of values. Smallstep and bigstep semantics are both inductively and coinductively defined. Moreover, small
Stochastic Lambda Calculus and Monads of Probability Distributions
 In 29th ACM POPL
, 2002
"... Probability distributions are useful for expressing the meanings of probabilistic languages, which support formal modeling of and reasoning about uncertainty. Probability distributions form a monad, and the monadic definition leads to a simple, natural semantics for a stochastic lambda calculus, as ..."
Abstract

Cited by 78 (0 self)
 Add to MetaCart
Probability distributions are useful for expressing the meanings of probabilistic languages, which support formal modeling of and reasoning about uncertainty. Probability distributions form a monad, and the monadic definition leads to a simple, natural semantics for a stochastic lambda calculus
Learning to Map Sentences to Logical Form: Structured Classification with Probabilistic Categorial Grammars
 In Proceedings of the 21st Conference on Uncertainty in AI
, 2005
"... This paper addresses the problem of mapping natural language sentences to lambda–calculus encodings of their meaning. We describe a learning algorithm that takes as input a training set of sentences labeled with expressions in the lambda calculus. The algorithm induces a grammar for the problem, alo ..."
Abstract

Cited by 157 (14 self)
 Add to MetaCart
This paper addresses the problem of mapping natural language sentences to lambda–calculus encodings of their meaning. We describe a learning algorithm that takes as input a training set of sentences labeled with expressions in the lambda calculus. The algorithm induces a grammar for the problem
BranchingTime Probabilistic ModelChecking \Lambda
"... Abstract This paper presents a probabilistic semantics for the alternationfree modalmucalculus. This semantics precisely defines the probability with which a system that includes a mixture of probabilistic and nondeterministic choicessatisfies a formula in the logic. An algorithm for computing the ..."
Abstract
 Add to MetaCart
Abstract This paper presents a probabilistic semantics for the alternationfree modalmucalculus. This semantics precisely defines the probability with which a system that includes a mixture of probabilistic and nondeterministic choicessatisfies a formula in the logic. An algorithm for computing
Abstract Stochastic Lambda Calculus and Monads of Probability Distributions
"... Probability distributions are useful for expressing the meanings of probabilistic languages, which support formal modeling of and reasoning about uncertainty. Probability distributions form a monad, and the monadic definition leads to a simple, natural semantics for a stochastic lambda calculus, as ..."
Abstract
 Add to MetaCart
Probability distributions are useful for expressing the meanings of probabilistic languages, which support formal modeling of and reasoning about uncertainty. Probability distributions form a monad, and the monadic definition leads to a simple, natural semantics for a stochastic lambda calculus
Church: A language for generative models
 In UAI
, 2008
"... Formal languages for probabilistic modeling enable reuse, modularity, and descriptive clarity, and can foster generic inference techniques. We introduce Church, a universal language for describing stochastic generative processes. Church is based on the Lisp model of lambda calculus, containing a pu ..."
Abstract

Cited by 141 (27 self)
 Add to MetaCart
Formal languages for probabilistic modeling enable reuse, modularity, and descriptive clarity, and can foster generic inference techniques. We introduce Church, a universal language for describing stochastic generative processes. Church is based on the Lisp model of lambda calculus, containing a
A Probabilistic ForesttoString Model for Language Generation from Typed Lambda Calculus Expressions
"... This paper describes a novel probabilistic approach for generating natural language sentences from their underlying semantics in the form of typed lambda calculus. The approach is built on top of a novel reductionbased weighted synchronous context free grammar formalism, which facilitates the trans ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
This paper describes a novel probabilistic approach for generating natural language sentences from their underlying semantics in the form of typed lambda calculus. The approach is built on top of a novel reductionbased weighted synchronous context free grammar formalism, which facilitates
On probabilistic coherence spaces
, 2008
"... We introduce a probabilistic version of coherence spaces and show that these objects provide a model of linear logic. We build a model of the pure lambdacalculus in this setting and show how to interpret a probabilistic version of the functional language PCF. We give a probabilistic interpretation ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We introduce a probabilistic version of coherence spaces and show that these objects provide a model of linear logic. We build a model of the pure lambdacalculus in this setting and show how to interpret a probabilistic version of the functional language PCF. We give a probabilistic interpretation
Communicating with Epistemic Modals in Stochastic λCalculus
"... Abstract Dynamic semantic theories generally treat epistemic modals as operators which test that their propositional argument bears some relation to the conversational common ground (e.g., entaiment or partial overlap), but do not change it. This means that epistemically modalized sentences do not c ..."
Abstract
 Add to MetaCart
in a recent probabilistic model of dynamics. We show how the challenges can be overcome using a model in which agents ’ knowledge is structured using hierarchical generative models and a semantics and pragmatics making crucial use of the stochastic lambda calculus implemented in the Church
Learning the Semantics of Manipulation Action
"... In this paper we present a formal computational framework for modeling manipulation actions. The introduced formalism leads to semantics of manipulation action and has applications to both observing and understanding human manipulation actions as well as executing them with a robotic mechanism ..."
Abstract
 Add to MetaCart
mechanism (e.g. a humanoid robot). It is based on a Combinatory Categorial Grammar. The goal of the introduced framework is to: (1) represent manipulation actions with both syntax and semantic parts, where the semantic part employs λcalculus; (2) enable a probabilistic semantic parsing schema
Results 1  10
of
14