Results 1  10
of
49,790
The Kell Calculus: A Family of HigherOrderDistributed Process Calculi
"... Abstract. This paper presents the Kell calculus, a family of distributed processcalculi, parameterized by languages for input patterns, that is intended as a basis for studying componentbased distributed programming. The Kell calculus isbuilt around a sscalculus core, and follows five design princ ..."
Abstract
 Add to MetaCart
Abstract. This paper presents the Kell calculus, a family of distributed processcalculi, parameterized by languages for input patterns, that is intended as a basis for studying componentbased distributed programming. The Kell calculus isbuilt around a sscalculus core, and follows five design
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
; the spi calculus enables us to consider cryptographic issues in more detail. We represent protocols as processes in the spi calculus and state their security properties in terms of coarsegrained notions of protocol equivalence.
A Calculus of Kells
 IN PROCEEDINGS 2ND INTERNATIONAL WORKSHOP ON FOUNDATIONS OF GLOBAL COMPUTING
, 2003
"... This paper introduces the Kell calculus, a new process calculus that retains the original insights of the Mcalculus (local actions, higherorder processes and programmable membranes) in a much simpler setting. The calculus is shown expressive enough to provide a direct encoding of several recent di ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
This paper introduces the Kell calculus, a new process calculus that retains the original insights of the Mcalculus (local actions, higherorder processes and programmable membranes) in a much simpler setting. The calculus is shown expressive enough to provide a direct encoding of several recent
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
, higherorder languages like Scheme, ML, and Common Lisp should run as fast as their FORTRAN and C counterparts. They should, but they don’t. A major reason is the level of optimisation applied to these two classes of languages. Many FORTRAN and C compilers employ an arsenal of sophisticated global
Graphical models, exponential families, and variational inference
, 2008
"... The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building largescale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical fiel ..."
Abstract

Cited by 800 (26 self)
 Add to MetaCart
of probability distributions — are best studied in the general setting. Working with exponential family representations, and exploiting the conjugate duality between the cumulant function and the entropy for exponential families, we develop general variational representations of the problems of computing
A Maximum Entropy approach to Natural Language Processing
 COMPUTATIONAL LINGUISTICS
, 1996
"... The concept of maximum entropy can be traced back along multiple threads to Biblical times. Only recently, however, have computers become powerful enough to permit the widescale application of this concept to real world problems in statistical estimation and pattern recognition. In this paper we des ..."
Abstract

Cited by 1341 (5 self)
 Add to MetaCart
describe a method for statistical modeling based on maximum entropy. We present a maximumlikelihood approach for automatically constructing maximum entropy models and describe how to implement this approach efficiently, using as examples several problems in natural language processing.
The Foundation of a Generic Theorem Prover
 Journal of Automated Reasoning
, 1989
"... Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized. Isabell ..."
Abstract

Cited by 471 (49 self)
 Add to MetaCart
. Isabelle is now based on higherorder logic  a precise and wellunderstood foundation. Examples illustrate use of this metalogic to formalize logics and proofs. Axioms for firstorder logic are shown sound and complete. Backwards proof is formalized by metareasoning about objectlevel entailment
An abstract machine for the Kell calculus
 IN 7TH IFIP INTERNATIONAL CONFERENCE ON FORMAL METHODS FOR OBJECTBASED DISTRIBUTED SYSTEMS (FMOODS
, 2005
"... The Kell Calculus is a family of process calculi intended as a basis for studying distributed componentbased programming. This paper presents an abstract machine for an instance of this calculus, a proof of its correctness, and a prototype OCaml implementation. The main originality of our abstract ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
The Kell Calculus is a family of process calculi intended as a basis for studying distributed componentbased programming. This paper presents an abstract machine for an instance of this calculus, a proof of its correctness, and a prototype OCaml implementation. The main originality of our
A Behavioral Notion of Subtyping
 ACM Transactions on Programming Languages and Systems
, 1994
"... The use of hierarchy is an important component of objectoriented design. Hierarchy allows the use of type families, in which higher level supertypes capture the behavior that all of their subtypes have in common. For this methodology to be effective, it is necessary to have a clear understanding of ..."
Abstract

Cited by 514 (18 self)
 Add to MetaCart
The use of hierarchy is an important component of objectoriented design. Hierarchy allows the use of type families, in which higher level supertypes capture the behavior that all of their subtypes have in common. For this methodology to be effective, it is necessary to have a clear understanding
Results 1  10
of
49,790