Results 1  10
of
75,647
The lambekgrishin calculus for unary connectives
 In Proceedings of the Workshop Symmetric calculi and Ludics for the semantic interpretation, 20th European Summer School on Logic, Language, and Information (ESSLLI
, 2008
"... In traditional Lambek style categorial grammar, derivable objects are sequents of the form Γ ⇒ C (where Γ in the antecedent could be considered as a product formulae context, whereas a succedent C is a single formula). The absence of a structural connective in the succedent of a sequent makes the wh ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In traditional Lambek style categorial grammar, derivable objects are sequents of the form Γ ⇒ C (where Γ in the antecedent could be considered as a product formulae context, whereas a succedent C is a single formula). The absence of a structural connective in the succedent of a sequent makes
Lambek–Grishin Calculus Extended to Connectives of Arbitrary Arity
"... This paper introduces Lambek–Grishin calculus for nary connectives, which can be seen as a generalization of binary and unary Lambek–Grishin calculus. It is a categorial grammar that is at least mildly contextsensitive, and allows for branching of arbitrary arity. Therefore it seems very suitable ..."
Abstract
 Add to MetaCart
This paper introduces Lambek–Grishin calculus for nary connectives, which can be seen as a generalization of binary and unary Lambek–Grishin calculus. It is a categorial grammar that is at least mildly contextsensitive, and allows for branching of arbitrary arity. Therefore it seems very
Continuation semantics for the Lambek–Grishin calculus
 INFORMATION AND COMPUTATION
, 2010
"... ..."
Continuation semantics for the LambekGrishin calculus
"... Categorial grammars in the tradition of Lambek [18, 19] are asymmetric: sequent statements are of the form Γ ⇒ A, where the succedent is a single formula A, the antecedent a structured configuration of formulas A1,..., An. The absence of structural context in the succedent makes the analysis of a nu ..."
Abstract
 Add to MetaCart
number of phenomena in natural language semantics problematic. A case in point is scope construal: the different possibilities to build an interpretation for sentences containing generalized quantifiers and related expressions. In this paper, we explore a symmetric version of categorial grammar, based
Proof nets for the LambekGrishin calculus
 Quantum Physics and Linguistics: A Compositional, Diagrammatic Discourse (Chris Heunen, Mehrnoosh Sadrzadeh, and
, 2013
"... ar ..."
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
Computational LambdaCalculus and Monads
, 1988
"... The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise the ..."
Abstract

Cited by 505 (7 self)
 Add to MetaCart
the applicability of theoretical results to real situations. In this paper we introduce a new calculus based on a categorical semantics for computations. This calculus provides a correct basis for proving equivalence of programs, independent from any specific computational model. 1 Introduction This paper
Semantics of ContextFree Languages
 In Mathematical Systems Theory
, 1968
"... "Meaning " may be assigned to a string in a contextfree language by defining "attributes " of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications of th ..."
Abstract

Cited by 559 (0 self)
 Add to MetaCart
. An algorithm is given which detects when such semantic rules could possibly lead to circular definition of some attributes. An example is given of a simple programming language defined with both inherited and synthesized attributes, and the method of definition is compared to other techniques for formal
Results 1  10
of
75,647