Results 1  10
of
227,850
Themen und weitere Hinweise für das Seminar
"... 3.4 Subcalculi of the πcalculus........................... 6 3.5 Contextual equivalence for higherorder picalculus revisited......... 6 3.6 Typed πCalculi................................. 7 3.7 The Join Calculus: A Language for Distributed Mobile Programming.... 7 3.8 May and Must Testing in the ..."
Abstract
 Add to MetaCart
3.4 Subcalculi of the πcalculus........................... 6 3.5 Contextual equivalence for higherorder picalculus revisited......... 6 3.6 Typed πCalculi................................. 7 3.7 The Join Calculus: A Language for Distributed Mobile Programming.... 7 3.8 May and Must Testing
Execution Contexts For Determining Trust In A HigherOrder piCalculus
"... A type system for the higher order picalculus is presented, using boolean annotations to carry information about the integrity of data. This extends previous work by the authors for a first order calculus; we argue that in a higher order setting certain notions of trustedness depend on the potenti ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A type system for the higher order picalculus is presented, using boolean annotations to carry information about the integrity of data. This extends previous work by the authors for a first order calculus; we argue that in a higher order setting certain notions of trustedness depend
Stochastic PiCalculus Revisited
"... Abstract. We develop a version of stochastic Picalculus with replication and fresh name quantification, endowed with a structural operational semantics expressed in terms of measure theory. The paper relies on two observations: (i) the structural congruence organizes a measurable space of processes ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We develop a version of stochastic Picalculus with replication and fresh name quantification, endowed with a structural operational semantics expressed in terms of measure theory. The paper relies on two observations: (i) the structural congruence organizes a measurable space
A calculus for cryptographic protocols: The spi calculus
 Information and Computation
, 1999
"... We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the ..."
Abstract

Cited by 919 (55 self)
 Add to MetaCart
We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols
Contextual Equivalence for the PiCalculus that can Stop
, 2014
"... Abstract. The picalculus is a wellanalyzed model for mobile processes and mobile computations. While a lot of other process and lambda calculi that are core languages of higherorder concurrent and/or functional programming languages use a contextual semantics observing the termination behavior of ..."
Abstract
 Add to MetaCart
Abstract. The picalculus is a wellanalyzed model for mobile processes and mobile computations. While a lot of other process and lambda calculi that are core languages of higherorder concurrent and/or functional programming languages use a contextual semantics observing the termination behavior
ControlFlow Analysis of HigherOrder Languages
, 1991
"... representing the official policies, either expressed or implied, of ONR or the U.S. Government. Keywords: dataflow analysis, Scheme, LISP, ML, CPS, type recovery, higherorder functions, functional programming, optimising compilers, denotational semantics, nonstandard Programs written in powerful, ..."
Abstract

Cited by 362 (10 self)
 Add to MetaCart
representing the official policies, either expressed or implied, of ONR or the U.S. Government. Keywords: dataflow analysis, Scheme, LISP, ML, CPS, type recovery, higherorder functions, functional programming, optimising compilers, denotational semantics, nonstandard Programs written in powerful
A Framework for Defining Logics
 JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY
, 1993
"... The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system of ariti ..."
Abstract

Cited by 807 (45 self)
 Add to MetaCart
conditions and leads to a uniform treatment of rules and proofs whereby rules are viewed as proofs of higherorder judgements and proof checking is reduced to type checking. The practical benefit of our treatment of formal systems is that logicindependent tools such as proof editors and proof checkers
KodairaSpencer theory of gravity and exact results for quantum string amplitudes
 Commun. Math. Phys
, 1994
"... We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a particu ..."
Abstract

Cited by 545 (60 self)
 Add to MetaCart
We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a
The lexical nature of syntactic ambiguity resolution
 Psychological Review
, 1994
"... Ambiguity resolution is a central problem in language comprehension. Lexical and syntactic ambiguities are standardly assumed to involve different types of knowledge representations and be resolved by different mechanisms. An alternative account is provided in which both types of ambiguity derive fr ..."
Abstract

Cited by 556 (23 self)
 Add to MetaCart
of apparently conflicting results concerning the roles of lexical and contextual information in sentence processing, explains differences among ambiguities in terms of ease of resolution, and provides a more unified account of language comprehension than was previously available. One of the principal goals
Results 1  10
of
227,850