Results 1  10
of
37,892
The Inverse Lambda Calculus Algorithm for Typed First Order Logic Lambda Calculus and Its Application to Translating English to FOL
"... Abstract. In order to answer questions and solve problems that require deeper reasoning with respect to a given text, it is necessary to automatically translate English sentences to formulas in an appropriate knowledge representation language. This paper focuses on a method to translate sentences to ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
to FirstOrder Logic (FOL). Our approach is inspired by Montague’s use of lambda calculus formulas to represent the meanings of words and phrases. Since our target language is FOL, the meanings of words and phrases are represented as FOLlambda formulas. In this paper we present algorithms that allow one
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
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
An algorithm for optimal lambda calculus reduction
, 1990
"... all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be ..."
Abstract

Cited by 150 (0 self)
 Add to MetaCart
all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must
Lambda Calculus
, 1997
"... Recursive functions are representable as lambda terms, and de nability in the calculus may be regarded as a de nition of computability. This forms part of the standard foundations of computer science. Lambda calculus is the commonly accepted basis of functional programming languages; and it is folkl ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Recursive functions are representable as lambda terms, and de nability in the calculus may be regarded as a de nition of computability. This forms part of the standard foundations of computer science. Lambda calculus is the commonly accepted basis of functional programming languages
The Partial LambdaCalculus
, 1988
"... This thesis investigates various formal systems for reasoning about partial functions or partial elements, with particular emphasis on lambda calculi for partial functions. Beeson's (intuitionistic) logic of partial terms (LPT) is taken as the basic formal system and some of its metamathematica ..."
Abstract

Cited by 35 (4 self)
 Add to MetaCart
This thesis investigates various formal systems for reasoning about partial functions or partial elements, with particular emphasis on lambda calculi for partial functions. Beeson's (intuitionistic) logic of partial terms (LPT) is taken as the basic formal system and some of its
Lambda Calculus and Related Systems
"... In this paper, we show how pattern matching can be seen to arise from a proof term assignment for the focused sequent calculus. This use of the CurryHoward correspondence allows us to give a novel coverage checking algorithm, and makes it possible to give a rigorous correctness proof for the classi ..."
Abstract
 Add to MetaCart
In this paper, we show how pattern matching can be seen to arise from a proof term assignment for the focused sequent calculus. This use of the CurryHoward correspondence allows us to give a novel coverage checking algorithm, and makes it possible to give a rigorous correctness proof
\Lambda
, 2001
"... Abstract We define a sound and complete proof system for affine fijretractions in simple types (built over many atoms), and we state a necessary condition for arbitrary fijretractions in simple types. We also show a simple necessary condition for polymorphic fijretractability and we disprove an e ..."
Abstract
 Add to MetaCart
Abstract We define a sound and complete proof system for affine fijretractions in simple types (built over many atoms), and we state a necessary condition for arbitrary fijretractions in simple types. We also show a simple necessary condition for polymorphic fijretractability and we disprove
1 Quantum Lambda Calculus
"... We discuss the design of a typed lambda calculus for quantum computation. After a brief discussion of the role of higherorder functions in quantum information theory, we define the quantum lambda calculus and its operational semantics. Safety invariants, such as the nocloning property, are enforce ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
We discuss the design of a typed lambda calculus for quantum computation. After a brief discussion of the role of higherorder functions in quantum information theory, we define the quantum lambda calculus and its operational semantics. Safety invariants, such as the nocloning property
Results 1  10
of
37,892